
Solairaju and Chithra introduced a new type of labeling of a graph G with p vertices and q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the set {1, 3, ... , 2q - 1} such that, when each vertex is assigned the sum of all edges incident to it mod 2q, the resulting vertex labels are distinct. In this paper, we proved necessary and sufficient conditions for the cylinder grid graph Cm,n = Pm × Cn and torus grid graph Tm,n = Cm × Cn are edge odd graceful.
Graceful labeling, cylinder grid graph, Electrical engineering. Electronics. Nuclear engineering, edge odd graceful labeling, torus grid graph, TK1-9971
Graceful labeling, cylinder grid graph, Electrical engineering. Electronics. Nuclear engineering, edge odd graceful labeling, torus grid graph, TK1-9971
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
