This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
1. Introduction
Graph theory plays a dynamic role in computer science, biological sciences, chemistry, and physics [1–7]. Graphs can also be found in other frameworks related to social and information systems [1]. Graphs are used to solves many issues related to everyday life. Many circuits are constructed in physics with the use of graphs [4]. Many unknown atomic numbers of molecules are found in a few years ago, using group symmetry through graphs [5]. In computer science, many problems are discussed by means of graphs which were not easy to visualize earlier. For discrete mathematics and combinatorics, the application of number theory and graph theory is of crucial importance. In this work, we employ this drive to investigate two special classes of graphs.
The concept of square mapping
Theorem 1 (See [17]).
If
Theorem 2 (See [17]).
If
Theorem 3 (See [18]).
Let
(1) If
(2) If
(3) If
Theorem 4 (See [19]).
Let
(1) The equation
(2) The equation
(3) When
Definition 1 (See [20]).
Let
2. Cubic Residues Graphs
In this section, we elaborate the concept of cubic residue graph and then characterize these graphs completely for each positive integer
Definition 2.
Let
Example 1.
For
In the following result, we characterize cubic residues graphs for the class of integers of the form
Theorem 5.
Let
(a) The graph
(b) If
(c) If
(d) The graph
Proof.
(a) Let
(b) Since,
(c) By Theorem 2, the number of nonzero different cubic residues of
(d) An integer
Hence, the reduced residue system of
In the following theorem, we find those integers for which cubic residues graphs are empty. This means that there is no connection between any two vertices of cubic residue graph.
Theorem 6.
If
Proof.
Let
Theorem 7.
If
Proof.
Let
The coming result is the main result of this section that characterizes cubic residue graph for each positive integer
Theorem 8.
If
Proof.
Let
The cubic residues graph for
[figure omitted; refer to PDF]
The following theorem characterizes Gaussian quadratic residues graphs
Theorem 9.
Let
Proof.
Let
Hence, we have
The number of solutions depends on the congruence
The Gaussian quadratic residues graph
[figure omitted; refer to PDF]
In the following theorem, we characterize Gaussian quadratic graphs
Theorem 10.
If
Proof.
Let
This implies that
Therefore,
Note that the congruence (12) has a solution if and only if
Since
Next result is the simple consequence of Theorems 9 and 10.
Theorem 11.
Let
Theorem 12.
Let
Proof.
Let
Case (I). If
Case (II). When
Next, we discuss the number of solutions in
The graph of
[figure omitted; refer to PDF]
Next, result is obtained by using the result, if
Theorem 13.
Let
(a) If
(b) If
(c) If
(d) If
(e) If
The following result characterizes Gaussian quadratic residues graphs
Theorem 14.
Let
4. Conclusion
In this article, we discussed the mapping
Acknowledgments
This research work was supported by the National University of Modern Languages, Lahore, Pakistan.
[1] N. Deo, Graph Theory with Applications to Engineering and Computer Science, 2017.
[2] N. Jafarzadeh, A. Iranmanesh, "Application of graph theory to biological problems," Studia Ubb Chemia, vol. 61, 2016.
[3] A. T. Balaban, "Applications of graph theory in chemistry," Journal of Chemical Information and Computer Sciences, vol. 25 no. 3, pp. 334-343, DOI: 10.1021/ci00047a033, 1985.
[4] F. Dorfler, F. Bullo, "Kron reduction of graphs with applications to electrical networks," IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 60 no. 1, pp. 150-163, DOI: 10.1109/tcsi.2012.2215780, 2013.
[5] K. Balasubramanian, "Graph theoretical perception of molecular symmetry," Chemical Physics Letters, vol. 232 no. 5-6, pp. 415-423, DOI: 10.1016/0009-2614(94)01382-6, 1995.
[6] N. Abbas, S. Nadeem, M. Y. Malik, "Theoretical study of micropolar hybrid nanofluid over Riga channel with slip conditions," Physica A: Statistical Mechanics and Its Applications, vol. 551,DOI: 10.1016/j.physa.2019.124083, 2020.
[7] N. Abbas, S. Nadeem, A. Saleem, M. Y. Malik, A. Issakhov, F. M. Alharbi, "Models base study of inclined MHD of hybrid nanofluid flow over nonlinear stretching cylinder," Chinese Journal of Physics, vol. 69, pp. 109-117, DOI: 10.1016/j.cjph.2020.11.019, 2021.
[8] T. D. Rogers, "The graph of the square mapping on the prime fields," Discrete Mathematics, vol. 148 no. 1-3, pp. 317-324, DOI: 10.1016/0012-365x(94)00250-m, 1996.
[9] L. Somer, M. Křížek, "Structure of digraphs associated with quadratic congruences with composite moduli," Discrete Mathematics, vol. 306 no. 18, pp. 2174-2185, DOI: 10.1016/j.disc.2005.12.026, 2006.
[10] M. K. Mahmood, F. Ahmad, "An informal enumeration of squares of 2 k using rooted trees arising from congruences," Utilitas Mathematica, vol. 105, pp. 41-51, 2017.
[11] M. K. Mahmood, F. Ahmad, "A classification of cyclic nodes and enumeration of components of a class of discrete graphs," Applied Mathematics & Information Sciences, vol. 9 no. 1, pp. 103-112, DOI: 10.12785/amis/090115, 2015.
[12] M. H. Mateen, M. K. Mahmood, "Power digraphs associated with the congruence x n ≡ y mod m," Punjab University Journal of Mathematics, vol. 51, pp. 93-102, 2019.
[13] M. H. Mateen, M. K. Mahmmod, M. K. Mahmmod, D. Alghazzawi, J.-B. Liu, "Structures of power digraphs over the congruence equation $ x^p\equiv y\; (\text{mod}\; m) $ and enumerations," AIMS Mathematics, vol. 6 no. 5, pp. 4581-4596, DOI: 10.3934/math.2021270, 2021.
[14] M. H. Mateen, M. K. Mahmood, "A new approch for the enumeration of components of digraphs over the quadratic maps," Journal of Prime Research in Mathematics, vol. 16, pp. 56-66, 2020.
[15] M. H. Mateen, M. K. Mahmood, S. Ali, "Importance of power digraph in computer science," Proceedings of the 2019 International Conference on Innovative Computing (ICIC), .
[16] Yang-Jiang, T. Gao-Hua, "The square mapping graphs of the ring Z n i," Journal of Mathematics, vol. 36, 2016.
[17] D. Namli, "Some results on cubic residues," International Journal of Algebra, vol. 9, pp. 245-249, DOI: 10.12988/ija.2015.5525, 2015.
[18] A. Adler, J. Coury, The Theory of Numbers, 1995.
[19] K. Ireland, M. Rosen, A Classical Introduction to Modern Number Theory, 1990.
[20] G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers, 1980.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Copyright © 2021 M. Haris Mateen et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0/
Abstract
In this study, we investigate two graphs, one of which has units of a ring
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details




1 Department of Management Science, National University of Modern Languages, Lahore, Pakistan
2 Department of Mathematics, University of the Punjab, Lahore, Pakistan
3 Department of Mathematics, Khwaja Fareed University of Engineering and Information Technology, Rahim Yar Khan, Pakistan
4 Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh