Name
Abstract | ||
|---|---|---|
A graph G = (V (G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V (G) to {0, 1, 2,..., 2q - 1} such that the edge labeling set is {1, 3, 5,..., 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that P-n x P-m (m = 2, 3, 4), generalized crown graphs C-n circle dot K-1, t and gear graphs are odd graceful. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1142/S1793830909000300 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Odd graceful graph, generalized crown graph, gear graph | Discrete mathematics,Odd graph,Combinatorics,Vertex-transitive graph,Bound graph,Graph power,Symmetric graph,Pathwidth,Universal graph,Mathematics,Edge-graceful labeling | Journal |
Volume | Issue | ISSN |
1 | 3 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen-Bin Gao | 1 | 0 | 1.35 |
| Xiao-Dong Zhang | 2 | 38 | 4.97 |
| Li-Juan Xu | 3 | 0 | 0.68 |