Abstract
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph with vertices and edges is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges incident to it where , the resulting vertex labels are distinct. In this paper we proved necessary and sufficient conditions for the polar grid graph to be edge even graceful graph.
Mathematics Subject Classification:
05C78
1. Introduction
The field of Graph Theory plays an important role in various areas of pure and applied sciences. One of the important areas in graph theory is Graph Labeling of a graph which is an assignment of integers either to the vertices or edges or both subject to certain conditions. Graph labeling is a very powerful tool that eventually makes things in different fields very ease to be handled in mathematical way. Nowadays graph labeling has much attention from different brilliant researches ingraph theory which has rigorous applications in many disciplines, e.g., communication networks, coding theory, x-raycrystallography, radar, astronomy, circuit design, communication network addressing, data base management and graph decomposition problems. More interesting applications of graph labeling can be found in [1,2,3,4,5,6,7,8,9,10].
Let with and be a simple, connected, finite, undirected graph.
A function is called a graceful labeling of a graph G if is injective and the induced function defined as is bijective. This type of graph labeling first introducedby Rosa in 1967 [11] as a valuation, later on Solomon W. Golomb [12] called as graceful labeling.
A function is called an odd graceful labeling of a graph G if is injective and the induced function defined as is bijective. This type of graph labeling first introducedby Gnanajothi in 1991 [13]. For more results on this type of labeling see [14,15].
A function is called an edge graceful labeling of a graph G if is bijective and the induced function defined as is bijective. This type of graph labeling first introducedby Lo in 1985 [16]. For more results on this labeling see [17,18].
A function is called an edge odd graceful labeling of a graph G if is bijective and the induced function defined as is injective. This type of graph labeling first introducedby Solairaju and Chithra in 2009 [19]. See also Daoud [20].
A function is called an edge even graceful labeling of a graph if is bijective and the induced function defined as where is injective. This type of graph labeling first introduced by Elsonbaty and Daoud in 2017 [21].
For a summary of the results on these five types of graceful labels as well as all known labels so far, see [22].
2. Polar Grid Graph
The polargrid graph is the graph consists of copies of circles which will be numbered from the inner most circle to the outer circle as and copies of paths intersected at the center vertex which will be numbered as . See Figure 1.
Figure 1.
Polar grid graph .
Theorem 1.
If m and n are even positive integes such that and , then the polar grid graph is an edge even graceful graph.
Proof.
Using standard notation and Let the polar grid graph be labeled as in Figure 2. Let □
Figure 2.
Labeling ofthe polar grid graph when n is even, .
First we label the edges of paths begin with the edges of the path to the edges of the path as follows: Move clockwise to label the edges by then move anticlockwise to label the edges by then move clockwise to label the edges by and so on. Finally move anticlockwise to label the edges by . Second we label the edges of the circles begin with the edges of the inner most circle to the edges of the circle , then the edges of the outer circle Finally the edges of circles respectively as follows: .
Now the corresponding labels of vertices are assigned as follows:
Case (1) and
The labels of the vertices of the inner most circle to the circle are given by , the labels of the vertices of the outre circle are given by and the labels of the vertices of the circles are given by .
The label of the center vertex is assigned as follows: when , , since then , thus and when , we have .
Case (2) . In this case the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and the label of the center vertex is assigened as .The rest vertices are labeled as in case(1).
Case (3) . In this case the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and the label of the center vertex is assigened as. The rest vertices are labeled as in case(1).
Case (4) . In this case the vertex in the outer circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and and the label of the center vertex is assigened as . The rest vertices are labeled as in case (1).
Illustration.


The edge even graceful labeling of the polar grid graphs
and respectively are shown in Figure 3.


Figure 3.
The edge even graceful labeling of the polar grid graphs and .
Remark 1.
In case and n is even, .
Let the label of edges of the polar grid graph be as in Figure 4. Thus we have the label of the corresponding vertices are as follows:
Figure 4.
Labeling of the polar grid graph , is even integer greater than .
- .
Note that is an edge even graceful graph but not follow this rule. See Figure 5.
Figure 5.
The polar grid graph .
Theorem 2.
If is an odd positive integer greater than and an is even positive integer greater than or equal , then the polar grid graph is an edge even graceful graph.
Proof.
Let the edges of the polar grid graph be labeled as in Figure 2. □
Now the corresponding labels of vertices are assigned as follows: There are four cases
Case (1):
The labels of the vertices of the inner most circle to the circle are given by , the labels of the vertices of the outer circle are given by and the labels of the vertices of the circles are given by .
The center vertex is labeled as , and if , we have .
Case (2): .
In this case the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and That is and and we obtain the labels of the corresponding vertices as follows and . The center vertex is labeled as . The rest vertices are labeled as in case (1).
Case (3): .
In this case the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and That is and and we obtain the labels of the corresponding vertices as follows and and in this case the center vertex is labeled as The rest vertices are labeled as in case (1).
Case (4):
In this case the vertex in the outer circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and That is and and we obtain the labels of the corresponding vertices as follows and the center vertex is labeled as The rest vertices are labeled as in case (1).
Illustration.

The edge even graceful labeling of the polar grid graphs
and respectively are shown in Figure 6.

Figure 6.
The edge even graceful labeling of the polar grid graphs and .
Theorem 3.
If is an even positive integer greater than or equal and is an odd positive integer greater than or equal . Then the polar grid graph is an edge even graceful graph.
Proof.
Let the polar grid graph be labeled as in Figure 7. Let □
Figure 7.
Labeling of the polar grid graph when is odd and .
First we label the edges of the circles begin with the edges of the inner most circle to edges of the outer circle as follows:
Second we label the edges of paths begin with the edges of the path as follows: Move anticlockwise to label the edges by , then move clockwise to label the edges by then move anticlockwise to label the edges by and so on. Finally move anticlockwise to label the edges by .
The corresponding labels of vertices are assigned as follows: There are four cases
Case (1) and
That is the labels of the vertices in the most inner circle are assigned by the labels of the vertices in the circle are assigned by , the labels of vertices of the circle are assigned by , the labels of vertices of the circle are assigned by , the labels of vertices of the circle are assigned by the labels of the vertices in the circle are assigned by and the labels of the vertices of the outer circle are assigned by The labels of the center vertex is assigned by when we have , when and when ,
Case (2)
In this case the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the label of two edges and . That is and and we obtain the labels of the corresponding vertices as follows and . In this case the center vertex is labeled as The rest vertices are labeled as in case (1).
Case (3) . In this case the vertex in the circle will repeat with the center vertex To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and and in this case the center vertex is labeled as The rest vertices are labeled as in case (1).
Case (4) In this case the vertex in the outer circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and and in this case the center vertex is labeled as The rest vertices are labeled as in case (1).
Illustration.


The edge even graceful labeling of the polar grid graphs and respectively are shown in Figure 8.


Figure 8.
The edge even graceful labeling of the polar grid graphs and .
Remark 2.
In case , is odd, .
Let the label of edges of the polar grid graph be as in Figure 9. Thus we have the labels of the corresponding vertices as follows: and .
Figure 9.
The labeling of the polar grid graph .
Illustration.
The edge even graceful labeling of the polar grid graphs is shown in Figure 10.
Figure 10.
The labeling of the polar grid graph .
Theorem 4.
If and are odd positive integers greater than . Then the polar grid graph is an edge even graceful graph.
Proof.
Let the polar grid graph be labeled as in Figure 7. Let □
The corresponding labels of vertices are assigned as follows: There are two cases:
Case (1) , this case contains five subcases as follows:
SubCase (i)
That is the labels of vertices of the most inner circle are assigned by , the labels of vertices of the circle are assigned by , the labels of the vertices of the circle are assigned by , the labels of the vertices of the circle are assigned by , the labels of the vertices of the circle are assigned by the labels of the vertices of the circle are assigned by and the labels of the vertices of the outer circle are assigned by . The label of the center vertex is assigned by , when , we have .
SubCase (ii) , . In this subcase the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and in this case the center vertex is labeled as The rest vertices will be labeled as in subCase (i).
Remark 3.
When and , in this case the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and the center vertex is labeld as .
SubCase (iii) In this subcase the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and in this case the center vertex is labeled as The rest vertices will be labeled as in subCase (i).
SubCase (iv) . In this case the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and and we obtain the labels of the corresponding vertices as follows and in this case the center vertex is labeled as The rest vertices will be labeled as in subCase (i).
SubCase (v) . In this case the vertex in the outer circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and we obtain the labels of the corresponding vertices are as follows and , and in this case the center vertex is labeled as The rest vertices will be labeled as in subCase (i).
Illustration.



The edge odd graceful labeling of the polar grid graphs and respectively are shown in Figure 11.



Figure 11.
The polar grid graphs and
Case (2) . This case contains also five subcases as follows:
SubCase (i)
That is the labels of vertices of the most inner circle are assigned by , the label of vertices of the circle are assigned by , the labels of vertices of the circle are assigned by , the labels of vertices of the circle are assigned by , the labels of vertices of the circle are assigned by the labels of vertices of the circle are assigned by and the labels of the vertices of the outer circle are assigned by . The label of the center vertex is assigned by , when , we have .
SubCase (ii) ,
In this subcase the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and That is and and we obtain the labels of the corresponding vertices as follows and the label of the center vertex is assigned by That rest vertices will be labeled as in subcase (i).
Remark 4.
When and , we have the vertex in the circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and That is and and we obtain the labes of the corresponding vertices are as follows: and the label of the center vertex is assigned by .
Note that is an edge even graceful grapg but not follow this rule. See Figure 12.
Figure 12.
The polar grid graphs .
SubCase (iii) ,
In this subcase the vertex in the circle will repeat with the center vertex To avoid this problem we replace the labels of the two edges and That is and and we obtain the labels of the corresponding vertices as follows: and . The label of the center vertex is assigned by The rest vertices will be labeled as in subCase (i).
SubCase (iv)
In this subcase the vertex in the circle will repeat with the center vertex To avoid this problem we replace the labels of the two edges and That is and and we obtain the labels of the corresponding vertices as follows and the label of the center vertex is labeled as The rest vertices will be labeled as in subCase (i).
Remark 5.
If we have
and the center vertex is labeled as
SubCase (v)
In this subcase the vertex in the outer circle will repeat with the center vertex . To avoid this problem we replace the labels of the two edges and . That is and we obtain the labes of the corresponding vertices as follows:
and and the label of the center vertex is assigned by
The rest vertices will be labeled as in subCase (i).
Illustration.


The edge odd graceful labeling of the polar grid graphs and respectively are shown in Figure 13.


Figure 13.
The polar grid graphs .
3. Conclusions
This paper gives some basic knowledge about the application of Graph labeling and Graph Theory in real life which is the one branch of mathematics. It is designed for the researcher who research in graph labeling and graph Theory. In this paper, we give necessary and sufficient conditions for a polar grid graph to admit edge even labeling. In future work we will study the necessary and sufficient conditions for the cylinder , torus and rectangular grid graphs to be edge even graceful.
Funding
This work was supported by the deanship of Scientific Research, Taibah University, Al-Madinah Al-Munawwarah, Saudi Arabia.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
References
- Acharya, B.D.; Arumugam, S.; Rosa, A. Labeling of Discrete Structures and Applications; Narosa Publishing House: New Delhi, India, 2008; pp. 1–14. [Google Scholar]
- Bloom, G.S. Numbered Undirected Graphs and Their Uses, a Survey of a Unifying Scientific and Engineering Concept and Its Use in Developing a Theory of Non-Redundant Homometric Sets Relating to Some Ambiguities in X-ray Diffraction Analysis. Ph.D. Thesis, University Southern California, Los Angeles, CA, USA, 1975. [Google Scholar]
- Bloom, G.S.; Golomb, S.W. Numbered complete graphs, unusual rulers, and assorted applications. In Theory and Applications of Graphs; Lecture Notes in Math; Springer: New York, NY, USA, 1978; Volume 642, pp. 53–65. [Google Scholar]
- Bloom, G.S.; Golomb, S.W. Applications of numbered undirected graphs. Proc. IEEE 1977, 65, 562–570. [Google Scholar] [CrossRef]
- Bloom, G.S.; Hsu, D.F. On graceful digraphs and a problem in network addressing. Congr. Numer. 1982, 35, 91–103. [Google Scholar]
- Graham, R.L.; Pollak, H.O. On the addressing problem for loop switching. Bell Syst. Tech. J. 1971, 50, 2495–2519. [Google Scholar] [CrossRef]
- Sutton, M. Summable Graphs Labellings and their Applications. Ph.D. Thesis, Department Computer Science, The University of Newcastle, Callaghan, Australia, 2001. [Google Scholar]
- Shang, Y. More on the normalized Laplacian Estrada index. Appl. Anal. Discret. Math. 2014, 8, 346–357. [Google Scholar] [CrossRef]
- Shang, Y. Geometric Assortative Growth Model for Small-World Networks. Sci. World J. 2014, 2014, 759391. [Google Scholar] [CrossRef] [PubMed]
- Gross, J.; Yellen, J. Graph Theory and Its Applications; CRC Press: London, UK, 1999. [Google Scholar]
- Rosa, A. Certain Valuations of the Vertices of a Graph; Theory of Graphs (Internat. Symp, Rome, July 1966); Gordan and Breach: New York, NY, USA; Paris, France, 1967; pp. 349–355. [Google Scholar]
- Golomb, S.W. How to Number a Graph. In Graph Theory and Computing; Read, R.C., Ed.; Academic Press: NewYork, NY, USA, 1972; pp. 23–37. [Google Scholar]
- Gnanajothi, R.B. Topics in Graph Theory. Ph.D. Thesis, Madurai Kamaraj University, Tamil Nadu, India, 1991. [Google Scholar]
- Seoud, M.A.; Abdel-Aal, M.E. On odd graceful graphs. Ars Comb. 2013, 108, 161–185. [Google Scholar]
- Gao, Z. Odd graceful labelings of some union graphs. J. Nat. Sci. Heilongjiang Univ. 2007, 24, 35–39. [Google Scholar]
- Lo, S.P. On edge-graceful1abelings of graphs. Congr. Numerantium 1985, 50, 231–241. [Google Scholar]
- Kuan, Q.; Lee, S.; Mitchem, J.; Wang, A. On Edge-Graceful Unicyclic Graphs. Congr. Numerantium 1988, 61, 65–74. [Google Scholar]
- Lee, L.; Lee, S.; Murty, G. On Edge-Graceful Labelings of Complete Graphs: Solutions of Lo’s Conjecture. Congr. Numerantium 1988, 62, 225–233. [Google Scholar]
- Solairaju, A.; Chithra, K. Edge-Odd Graceful Graphs. Electron. Notes Discret. Math. 2009, 33, 15–20. [Google Scholar] [CrossRef]
- Daoud, S.N. Edge odd graceful labeling of some path and cycle related graphs. AKCE Int. J. Graphs Comb. 2017, 14, 178–203. [Google Scholar] [CrossRef]
- Elsonbaty, A.; Daoud, S.N. Edge even graceful labeling of some path and cycle related graphs. Ars Comb. 2017, 130, 79–96. [Google Scholar]
- Gallian, J.A. A Dynamic Survey of Graph Labeling. Electron. J. Comb. 2017, 22, #DS6. [Google Scholar]
© 2019 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).