University of Southeastern Philippines, Philippines
University of Southeastern Philippines, Philippines
* Corresponding author

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 G=(V,E) has a vertex set V=V(G) and an edge set E=E(G), and the cardinalities |V| and |E| are called the order and size of G, 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 x2a(modp), where p 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 (a/p) which states that if p is an odd prime and a is an integer relatively prime to p, then (a/p)=1 whenever x2a(modp) has a solution; otherwise, (a/p)=1. 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 p be an odd prime. For a simple connected graph G=(V,E) of order n, a bijective function f:V(G){1,2,,n} is said to be a Legendre cordial labeling modulo p if the induced function fp:E(G){0,1} is defined by

f p ( u v ) = { 0  if  ( ω u v / p ) = 1  or  ω u v = 0 1  if  ( ω u v / p ) = 1

given that f(u)+f(v)ωuv(modp), 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). A graph that admits a Legendre cordial labeling modulo p is called a Legendre cordial graph modulo p.

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 Pn of order n is a graph with vertex set V(Pn)={v1,v2,,vn} and edge set E(Pn)={v1v2,v2v3,,vn1vn}.

Definition 2.2. A cycle graph Cn of order n is a graph with vertex set V(Cn)={v1,v2,,vn} and edge set E(Cn)={v1v2,v2v3,,vn1vn,vnv1}.

Definition 2.3. A star graph Sn of order n is a graph obtained from vertices v1,v2,,vn1 and connects each of these vertices to a central vertex vn.

Definition 2.4. A tadpole graph Tn,m of order n+m is obtained from a cycle graph Cn and path graph Pm+1 where a pendant vertex (a vertex with degree 1) is a vertex of Cn.

Definition 2.5. A kayak paddle graph KPn,m,k of order n+m+k is a graph obtained from two cycle graphs Cn and Ck, and path graph Pm+2 for which a pendant vertex of Pm+2 is a vertex of Cn and the other pendant vertex is a vertex of Ck.

Definition 2.6. A bistar graph Bn,m of order n+m is obtained from two star graphs Sn and Sm such that the central vertex of Sn is adjacent to the central vertex of Sm.

Definition 2.7. A fan graph Fn of order n is obtained from path graph Pn1 and connects each vertex of Pn1 to a new vertex x0.

Definition 2.8. Let p be an odd prime and a be an integer relatively prime to p. Then a is a quadratic residue of p if the quadratic congruence x2a(mod p) has a solution. Otherwise, a is a quadratic nonresidue of p. The Legendre symbol (a/p) is defined as (a/p)=1 if a is a quadratic residue of p; otherwise, (a/p)=1.

Theorem 2.9. [3] Let p be an odd prime. Then p has p12 quadratic residues and p12 quadratic nonresidues in the set {1,2,,p1}.

Theorem 2.10. [3] Let p be an odd prime and let a and b be integers relatively prime to p. If ab(modp), then (a/p)=(b/p).

Main Results

In the succeeding discussion, we denote p as an odd prime.

Lemma 3.1. There exists an integer k, 0k<p, such that (p+2k±12/p)=1.

Proof. Define θk(p+2k±1)/2(modp), 0θk<p, for k=1,2,,p1. Let ζ={θk:k=0,1,,p1}, then ζ={0,1,,p1}. According to Theorem 2.9, p has p12 quadratic residues in set ζ. Thus, (θk/p)=1 for some integer k, 0k<p. Because (p+2k±12/p)=(θk/p) by Theorem 2.10, there exists an integer k, 0k<p, such that (p+2k±12/p)=1. □

Theorem 3.2. The path graph Pp is a Legendre cordial graph modulo p.

Proof. Let V(Pp)={v1,v2,,vp} and define the bijective function f:V(Pp){1,2,,p} by

f ( v i ) = { i + p 1 2  for  i = 1 , 2 , , p + 1 2 i p + 1 2  for  i = p + 3 2 , p + 5 2 , , p .

As a consequence, for vivi+1E(Pp),

f ( v i ) + f ( v i + 1 ) { 2 i ( mod p )  for  i = 1 , 2 , , p 1 2 ( 2 i p ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p 1.

In view of this labeling, let

α = { ξ : f ( v i ) + f ( v i + 1 ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p 1 } .

Thus, α={1,2,,p1} and by Theorem 2.9, p has p12 quadratic residues and p12 quadratic nonresidues in set α. Hence, efp(0)=efp(1)=p12. Therefore, |efp(0)efp(1)|=0 and it follows that Pp admits a Legendre cordial labeling modulo p. □

Example 3.3. Fig. 1 presents the Legendre cordial labeling modulo p of the path graph Pp, specifically illustrated for the case p=7.

Fig. 1. Legendre cordial labeling modulo 7 of P7.

Theorem 3.4. The cycle graph Cp is a Legendre cordial graph modulo p.

Proof. Let V(Cp)={v1,v2,,vp} and suppose that f:V(Cp){1,2,,p} is a bijective function defined by f(vi)=i for i=1,2,,p. Consequently, for vivi+1E(Cp),

f ( v i ) + f ( v i + 1 ) { ( 2 i + 1 ) ( mod p )  for  i = 1 , 2 , , p 3 2 0 ( mod p )  for  i = p 1 2 ( 2 i p + 1 ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p ,

and for v1vpE(Cp), f(v1)+f(vp)1(modp). In view of the above labeling, suppose that

α = { ξ : f ( v i ) + f ( v i + 1 ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p , i ( p 1 ) / 2 }

and

β = { ξ : f ( v 1 ) + f ( v p ) ξ ( mod p ) , 0 < ξ < p } .

Thus, αβ={1,2,,p1}. By Theorem 2.9, there are p12 quadratic residues and p12 quadratic nonresidues of p in the set αβ. Additionally, notice that fp(v(p1)/2v(p+1)/2)=0. Therefore, efp(0)=p12+1 and efp(1)=p12. Hence, |efp(0)efp(1)|=1 and it follows that Cp admits a Legendre cordial labeling modulo p. □

Example 3.5. The Legendre cordial labeling modulo p of the cycle graph Cp, with p=7, is shown in Fig. 2.

Fig. 2. Legendre cordial labeling modulo 7 of C7.

Theorem 3.6. The star graph Sp is a Legendre cordial graph modulo p.

Proof. Let V(Sp)={v1,v2,,vp} where vp is a central vertex. Now, let f:V(Sp){1,2,,p} be a bijective function defined by f(vi)=i for i=1,2,,p. So, for vivpE(Sp), f(vi)+f(vp)i(modp) for i=1,2,,p1. In view of this labeling, suppose that

α = { ξ : f ( v i ) + f ( v p ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p 1 } .

Consequently, α={1,2,,p1}. According to Theorem 2.9, there are p12 quadratic residues and p12 quadratic nonresidues of p in set α. Therefore, efp(0)=efp(1)=p12 and it follows that |efp(0)efp(1)|=0. Hence, Sp admits a Legendre cordial labeling modulo p. □

Example 3.7. An illustration of the Legendre cordial labeling modulo p of the star graph Sp for p=7 is provided in Fig. 3.

Fig. 3. Legendre cordial labeling modulo 7 of S7.

Theorem 3.8. The tadpole graph Tp,p is a Legendre cordial graph modulo p.

Proof. According to Lemma 3.1, there exists an integer k, 0k<p, such that (p+2k+12/p)=1. Let Cp be a cycle and Pp+1 be a path of Tp,p with V(Cp)={v1,v2,,vp} and V(Pp+1)={vk,u1,u2,,up}. We define the bijective function f:V(Tp,p){1,2,,2p} by f(vi)=i for i=1,2,,p, and

f ( u i ) = { i + p 1 2 + p  for  i = 1 , 2 , , p + 1 2 i p + 1 2 + p  for  i = p + 3 2 , p + 5 2 , , p .

For the edges of Cp,

f ( v i ) + f ( v i + 1 ) { ( 2 i + 1 ) ( mod p )  for  i = 1 , 2 , , p 3 2 0 ( mod p )  for  i = p 1 2 ( 2 i p + 1 ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p ,

and f(v1)+f(vp)1(modp). For the edges of Pp+1,

f ( u i ) + f ( u i + 1 ) { 2 i ( mod  p )  for  i = 1 , 2 , , p 1 2 ( 2 i p ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p 1.

and f(vk)+f(u1)p+2k+12(modp).

In view of the above labeling, let

α = { ξ : f ( v i ) + f ( v i + 1 ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p , i ( p 1 ) / 2 } ,

β = { ξ : f ( v 1 ) + f ( v p ) ξ ( mod p ) , 0 < ξ < p } , a n d

γ = { ξ : f ( u i ) + f ( u i + 1 ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p 1 } .

Thus, αβ=γ={1,2,,p1}. According to Theorem 2.9, there are p12 quadratic residues and p12 quadratic nonresidues of p in the sets αβ and γ. Additionally, notice that fp(v(p1)/2v(p+1)/2)=0 and fp(vku1)=1. Therefore, efp(0)=efp(1)=2(p12)+1=p. Hence, |efp(0)efp(1)|=0 and it follows that Tp,p admits a Legendre cordial labeling modulo p. □

Example 3.9. In Fig. 4, one can observe the Legendre cordial labeling modulo p of the tadpole graph Tp,p for a particular case when p=7.

Fig. 4. Legendre cordial labeling modulo 7 of T7,7.

Theorem 3.10. The kayak paddle graph KPp,p,p is a Legendre cordial graph modulo p.

Proof. Note that there exist integers k1 and k2, 0k1,k2<p, for which (p+2k1+12/p)=(p+2k212/p)=1 according to Lemma 3.1. Now, suppose that Cp1 and Cp2 are cycles of KPp,p,p with V(Cpj)={v1j,v2j,,vpj} for j=1,2, and let Pp+2 be the path of KPp,p,p with V(Pp+2)={vk11,u1,u2,,up,vk22}. Furthermore, define the bijective function f:V(KPp,p,p){1,2,,3p} by f(vi1)=i and f(vi2)=i+2p for i=1,2,,p, and

f ( u i ) = { i + p 1 2 + p  for  i = 1 , 2 , , p + 1 2 i p + 1 2 + p  for  i = p + 3 2 , p + 5 2 , , p .

For the edges of Cpj,

f ( v i j ) + f ( v i + 1 j ) { ( 2 i + 1 ) ( mod p )  for  i = 1 , 2 , , p 3 2 0 ( mod p )  for  i = p 1 2 ( 2 i p + 1 ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p ,

and f(v1j)+f(vpj)1(modp) for j=1,2. For the edges of Pp+2,

f ( u i ) + f ( u i + 1 ) { 2 i ( mod p )  for  i = 1 , 2 , , p 1 2 ( 2 i p ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p 1 ,

f(vk11)+f(u1)p+2k1+12(modp), and f(up)+f(vk22)p+2k212(modp).

In view of the above labeling, let

α j = { ξ : f ( v i j ) + f ( v i + 1 j ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p , i ( p 1 ) / 2 } , a n d

β j = { ξ : f ( v 1 j ) + f ( v p j ) ξ ( mod p ) , 0 < ξ < p }

for j=1,2, and suppose that

γ = { ξ : f ( u i ) + f ( u i + 1 ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p 1 } .

So, α1β1=α2β2=γ={1,2,,p1}. By Theorem 2.9, there are p12 quadratic residues and p12 quadratic nonresidues of p in the sets α1β1, α2β2, and γ. Additionally, observe that fp(v(p1)/2jv(p+1)/2j)=0 for j=1,2, and fp(vk11u1)=fp(upvk22)=1. Thus, efp(0)=efp(1)=3(p12)+2. Consequently, |efp(0)efp(1)|=0 and it follows that KPp,p,p admits a Legendre cordial labeling modulo p.

Example 3.11. Fig. 5 shows the Legendre cordial labeling modulo p of the kayak paddle graph KPp,p,p when p=5.

Fig. 5. Legendre cordial labeling modulo 5 of KP5,5,5.

Theorem 3.12. The bistar graph Bp,p is a Legendre cordial graph modulo p.

Proof. Let Sp1 and Sp2 be star graphs of Bp,p with V(Spj)={v1j,v2j,,vpj} where vpj is the central vertex of Spj, for j=1,2. Now, let f:V(Bp,p){1,2,,2p} be a bijective function defined by f(vij)=i+(j1)p for i=1,2,,p and j=1,2. So, for vijvpjE(Bp,p), f(vij)+f(vpj)i(modp) for i=1,2,,p1 and j=1,2, and for vp1vp2E(Bp,p), f(vp1)+f(vp2)0(modp). Given this labeling, let

α j = { ξ : f ( v i j ) + f ( v p j ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p 1 }

for j=1,2. Thus, α1=α2={1,2,p1} and by Theorem 2.9, there are p12 quadratic residues and p12 quadratic nonresidues of p in the sets α1 and α2. Additionally, observe that fp(vp1vp2)=0. So, efp(0)=2(p12)+1=p and efp(1)=2(p12)=p1. Hence, |efp(0)efp(1)|=1 and it follows that Bp,p admits a Legendre cordial labeling modulo p. □

Example 3.13. Fig. 6 shows the Legendre cordial labeling modulo p of the bistar graph Bp,p, where p=7.

Fig. 6. Legendre cordial labeling modulo 7 of B7,7.

Theorem 3.14. The fan graph Fp+1 is a Legendre cordial graph modulo p.

Proof. Let Pp be a path of Fp+1 with V(Pp)={v1,v2,,vp}. Suppose that vp+1 is a new vertex for which vivp+1E(Fp+1) for i=1,2,,p. Now, let f:V(Fp+1){1,2,,p+1} be a bijective function defined by

f ( v i ) = { i + p 1 2  for  i = 1 , 2 , , p + 1 2 i p + 1 2  for  i = p + 3 2 , p + 5 2 , , p ,

and f(vp+1)=p+1. For the edges of Pp,

f ( v i ) + f ( v i + 1 ) { 2 i ( mod p )  for  i = 1 , 2 , , p 1 2 ( 2 i p ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p 1.

For the remaining the edges of Fp+1,

f ( v i ) + f ( v p + 1 ) { ( i + p + 1 2 ) ( mod p )  for  i = 1 , 2 , , p 3 2 0 ( mod p )  for  i = p 1 2 ( i p 1 2 ) ( mod p )  for  i = p + 1 2 , p + 3 2 , , p 1.

In view of the above labeling, let

α = { ξ : f ( v i ) + f ( v i + 1 ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p 1 } , a n d

β = { ξ : f ( v i ) + f ( v p + 1 ) ξ ( mod p ) , 0 < ξ < p , i = 1 , 2 , , p , i ( p 1 ) / 2 } .

Thus, α=β={1,2,,p1} and by Theorem 2.9, there are p12 quadratic residues and p12 quadratic nonresidues of p in sets α and β. Additionally, notice that fp(v(p1)/2vp+1)=0. Hence, efp(0)=2(p12)+1=p and efp(0)=2(p12)=p1. Clearly, |efp(0)efp(1)|=1. Therefore, Fp+1 admits a Legendre cordial labeling modulo p. □

Example 3.15. Fig. 7 shows the Legendre cordial labeling modulo p of the fan graph Fp+1 for the case p=11.

Fig. 7. Legendre cordial labeling modulo 11 of F12.

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 Pp, cycle graph Cp, star Sp, tadpole graph Tp,p, kayak paddle graph KPp,p,p, bistar graph Bp,p, and fan graph Fp+1 admit a Legendre cordial labeling modulo p, where p 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. [1] Chartrand G, Zhang P. Chromatic Graph Theory. CRC Press; 2009.
     Google Scholar
  2. [2] Burton D. Elementary Number Theory. 7th ed. McGraw-Hill; 2011.
     Google Scholar
  3. [3] Rosen K. Elementary Number Theory and its Application. 6th ed. Addison Wesley; 2011.
     Google Scholar
  4. [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
  5. [5] Cahit I. Cordial graphs: a weaker version of graceful and harmonious graphs. Ars Combinatoria. 1987;23:201–7.
     Google Scholar
  6. [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
  7. [7] Suguraman A, Rajesh K. Lucas divisor cordial labeling. Int J Pure Appl Math. 2017;113(6):233–41.
     Google Scholar
  8. [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
  9. [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
  10. [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