On Legendre Cordial Labeling of Some Graphs
Article Main Content
For a simple connected graph G = (V, E), a bijective function f : V(G) → {1, 2, ..., |V|} is said to be a Legendre cordial labeling modulo p, where p is an odd prime, if the induced function fp ∗ : E(G) → {0, 1} defined by fp ∗ (uv) = 0 if (ωuv/p) = −1 or ωuv = 0, and fp ∗(uv) = 1 if (ωuv/p) = 1, where f (u) + f (v) ≡ ωuv (mod p), 0 ≤ ωuv < p, satisfies the condition efp * (0) − efp ∗ (1) ≤ 1, where efp ∗ (i) is the number of edges with label i (i = 0, 1). In this paper, we determined the values of n, m, and k so that the following special graphs admit a Legendre cordial labeling modulo p for an odd prime p: path graph Pn, cycle graph Cn, star graph Sn, tadpole graph Tn,m, kayak paddle graph KPn,m,k, bistar graph Bn,m, and fan graph Fn.
Introduction
In this study, only graphs that were finite, simple, and connected were considered. A graph has a vertex set and an edge set , and the cardinalities and are called the order and size of , respectively. For a general reference to graph-theoretic notions, refer to [1]. Graph labeling is a concept in graph theory in which integers are assigned to vertices or edges (or both) subject to certain conditions. This topic is an active area of research with numerous applications in coding theory and communications.
In the number theory, finding solutions to certain equations or congruences (subject to certain conditions) is very important. Quadratic congruence , where is an odd prime, has been studied for many years, and several properties have been established to test whether the congruence has a solution. Legendre, a French mathematician, introduced the Legendre symbol which states that if is an odd prime and is an integer relatively prime to , then whenever has a solution; otherwise, . Several properties of the Legendre symbol can be found in previous studies [2], [3]. Various topics in number theory such as encryption, decryption, and the Fibonacci series, are now significant in the fields of cryptography, computer science, and engineering [4].
In 1987, Cahit [5] introduced a new graph-labeling method called cordial labeling. This graph labeling is considered a weaker version of graceful labeling and harmonious labeling. It also serves as a foundation for different topics of graph labeling, such as total product cordial labeling [6], Lucas divisor cordial labeling [7], and Fibonacci cordial labeling [8]. In fact, some topics of cordial labeling, namely, sum cordial labeling and mean cordial labeling, are utilized to study blood circulation, human anatomy, and the circulatory system [9], [10].
In this study, we introduce a new type of cordial labeling, called Legendre cordial labeling. Let be an odd prime. For a simple connected graph of order , a bijective function is said to be a Legendre cordial labeling modulo if the induced function is defined by
given that , , satisfies the condition , where is the number of edges with label (). A graph that admits a Legendre cordial labeling modulo is called a Legendre cordial graph modulo .
Additionally, this new type of cordial labeling extends the traditional graph labeling methods by incorporating the Legendre symbol. In addition, this approach aims to investigate new mathematical structures in graph labeling and to explore their potential applications in real life.
Preliminaries
Definition 2.1. A path graph of order is a graph with vertex set and edge set .
Definition 2.2. A cycle graph of order is a graph with vertex set and edge set .
Definition 2.3. A star graph of order is a graph obtained from vertices and connects each of these vertices to a central vertex .
Definition 2.4. A tadpole graph of order is obtained from a cycle graph and path graph where a pendant vertex (a vertex with degree 1) is a vertex of .
Definition 2.5. A kayak paddle graph of order is a graph obtained from two cycle graphs and , and path graph for which a pendant vertex of is a vertex of and the other pendant vertex is a vertex of .
Definition 2.6. A bistar graph of order is obtained from two star graphs and such that the central vertex of is adjacent to the central vertex of .
Definition 2.7. A fan graph of order is obtained from path graph and connects each vertex of to a new vertex .
Definition 2.8. Let be an odd prime and be an integer relatively prime to . Then is a quadratic residue of if the quadratic congruence has a solution. Otherwise, is a quadratic nonresidue of . The Legendre symbol is defined as if is a quadratic residue of ; otherwise, .
Theorem 2.9. [3] Let be an odd prime. Then has quadratic residues and quadratic nonresidues in the set .
Theorem 2.10. [3] Let be an odd prime and let and be integers relatively prime to . If , then .
Main Results
In the succeeding discussion, we denote as an odd prime.
Lemma 3.1. There exists an integer , , such that .
Proof. Define , , for Let , then . According to Theorem 2.9, has quadratic residues in set . Thus, for some integer , . Because by Theorem 2.10, there exists an integer , , such that . □
Theorem 3.2. The path graph is a Legendre cordial graph modulo .
Proof. Let and define the bijective function by
As a consequence, for ,
In view of this labeling, let
Thus, and by Theorem 2.9, has quadratic residues and quadratic nonresidues in set . Hence, . Therefore, and it follows that admits a Legendre cordial labeling modulo . □
Example 3.3. Fig. 1 presents the Legendre cordial labeling modulo of the path graph , specifically illustrated for the case .
Fig. 1. Legendre cordial labeling modulo of .
Theorem 3.4. The cycle graph is a Legendre cordial graph modulo .
Proof. Let and suppose that is a bijective function defined by for . Consequently, for ,
and for , . In view of the above labeling, suppose that
and
Thus, . By Theorem 2.9, there are quadratic residues and quadratic nonresidues of in the set Additionally, notice that . Therefore, and Hence, and it follows that admits a Legendre cordial labeling modulo . □
Example 3.5. The Legendre cordial labeling modulo of the cycle graph , with , is shown in Fig. 2.
Fig. 2. Legendre cordial labeling modulo of .
Theorem 3.6. The star graph is a Legendre cordial graph modulo .
Proof. Let where is a central vertex. Now, let be a bijective function defined by for . So, for , for In view of this labeling, suppose that
Consequently, . According to Theorem 2.9, there are quadratic residues and quadratic nonresidues of in set Therefore, and it follows that . Hence, admits a Legendre cordial labeling modulo . □
Example 3.7. An illustration of the Legendre cordial labeling modulo of the star graph for is provided in Fig. 3.
Fig. 3. Legendre cordial labeling modulo of .
Theorem 3.8. The tadpole graph is a Legendre cordial graph modulo .
Proof. According to Lemma 3.1, there exists an integer , , such that Let be a cycle and be a path of with and . We define the bijective function by for , and
For the edges of ,
and For the edges of ,
and
In view of the above labeling, let
Thus, According to Theorem 2.9, there are quadratic residues and quadratic nonresidues of in the sets and . Additionally, notice that and . Therefore, . Hence, and it follows that admits a Legendre cordial labeling modulo . □
Example 3.9. In Fig. 4, one can observe the Legendre cordial labeling modulo of the tadpole graph for a particular case when .
Fig. 4. Legendre cordial labeling modulo of .
Theorem 3.10. The kayak paddle graph is a Legendre cordial graph modulo .
Proof. Note that there exist integers and , , for which according to Lemma 3.1. Now, suppose that and are cycles of with for , and let be the path of with . Furthermore, define the bijective function by and for , and
For the edges of ,
and for . For the edges of ,
, and .
In view of the above labeling, let
for , and suppose that
So, By Theorem 2.9, there are quadratic residues and quadratic nonresidues of in the sets , and . Additionally, observe that for , and . Thus, . Consequently, and it follows that admits a Legendre cordial labeling modulo □
Example 3.11. Fig. 5 shows the Legendre cordial labeling modulo of the kayak paddle graph when .
Fig. 5. Legendre cordial labeling modulo of .
Theorem 3.12. The bistar graph is a Legendre cordial graph modulo .
Proof. Let and be star graphs of with where is the central vertex of , for Now, let be a bijective function defined by for and . So, for , for and , and for , . Given this labeling, let
for . Thus, and by Theorem 2.9, there are quadratic residues and quadratic nonresidues of in the sets and . Additionally, observe that . So, and . Hence, and it follows that admits a Legendre cordial labeling modulo . □
Example 3.13. Fig. 6 shows the Legendre cordial labeling modulo of the bistar graph , where .
Fig. 6. Legendre cordial labeling modulo of .
Theorem 3.14. The fan graph is a Legendre cordial graph modulo .
Proof. Let be a path of with . Suppose that is a new vertex for which for . Now, let be a bijective function defined by
and For the edges of
For the remaining the edges of
In view of the above labeling, let
Thus, and by Theorem 2.9, there are quadratic residues and quadratic nonresidues of in sets and . Additionally, notice that . Hence, and . Clearly, . Therefore, admits a Legendre cordial labeling modulo . □
Example 3.15. Fig. 7 shows the Legendre cordial labeling modulo of the fan graph for the case .
Fig. 7. Legendre cordial labeling modulo of .
Conclusion
In this study, we proposed a new type of cordial labeling, called Legendre cordial labeling, which incorporates the Legendre symbol into graph labeling. We demonstrated that the path graph , cycle graph , star , tadpole graph , kayak paddle graph , bistar graph , and fan graph admit a Legendre cordial labeling modulo , where is an odd prime. This contributes to the growing field of cordial labeling by linking graph theory with classical number-theoretic ideas. Future work may focus on identifying other graph classes that admit this labeling and investigating possible applications in cryptography, network analysis, and related areas.
References
-
[1] Chartrand G, Zhang P. Chromatic Graph Theory. CRC Press; 2009.
Google Scholar
1
-
[2] Burton D. Elementary Number Theory. 7th ed. McGraw-Hill; 2011.
Google Scholar
2
-
[3] Rosen K. Elementary Number Theory and its Application. 6th ed. Addison Wesley; 2011.
Google Scholar
3
-
[4] Ghosal G. A study on the development and application of number theory in engineering field. Int J Inf Sci Comput. 2020;7(2):109–14. doi: 10.30954/2348-7437.2.2020.5.
Google Scholar
4
-
[5] Cahit I. Cordial graphs: a weaker version of graceful and harmonious graphs. Ars Combinatoria. 1987;23:201–7.
Google Scholar
5
-
[6] Pedrano A, Rulete R. On the total product cordial labeling on the cartesian product of Pm × Cn, Cm × Cn and the generalized Petersen graph P(n, m). Malaya J Matimatik. 2017;5(3):513–39. doi: 10.26637/mjm503/007.
Google Scholar
6
-
[7] Suguraman A, Rajesh K. Lucas divisor cordial labeling. Int J Pure Appl Math. 2017;113(6):233–41.
Google Scholar
7
-
[8] Sulayman J, Pedrano A. On fibonacci cordial labeling of some snake graphs. Eur J Math Stat. 2023;4(2):29–35. doi: 10.24018/ejmath.2023.4.2.193.
Google Scholar
8
-
[9] Anto Cathrin Aanisha A, Manoharan R. Mean cordial labeling in graph representations of human anatomy and circulatory systems. Commun Appl Nonlinear Anal. 2024;31(7):453–8. doi: 10.52783/cana.v31.1324.
Google Scholar
9
-
[10] Aravindan SJ, Sasikala D, Divya A. Visualization of cordial graph in human excretion track. Italian J Pure Appl Math. 2020;44:460–9.
Google Scholar
10