Random Articles
Reseach Article
Odd Graceful Labeling of the Revised Friendship Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 65 - Number 11 |
| Year of Publication: 2013 |
| Authors: E. M. Badr |
10.5120/10965-6017
|
E. M. Badr . Odd Graceful Labeling of the Revised Friendship Graphs. International Journal of Computer Applications. 65, 11 ( March 2013), 1-6. DOI=10.5120/10965-6017
Abstract
The aim of this paper is to present some odd graceful graphs. In particular we show that the revised friendship graphs F(kC4), F(kC8), F(kC12), F(kC16) and F(kC20) are odd graceful where k is any positive integer. Finally, we introduce a new conjecture " The revised friendship graph F(kCn) is odd graceful where k is any positive integer and n = 0 (mod 4 ).
References
- R. B. Gnanajothi, Topics in graph theory, Ph. D. thesis, Madurai Kamaraj University, India, 1991.
- E. M. Badr, On the Odd Gracefulness of Cyclic Snakes With Pendant Edges, International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) Vol. 4, No. 4, December 2012.
- E. M. Badr, M. I. Moussa & K. Kathiresan (2011): Crown graphs and subdivision of ladders are odd graceful, International Journal of Computer Mathematics, 88:17, 3570-3576.
- A. Rosa, On certain valuation of the vertices of a graph, Theory of Graphs (International Symposium, Rome, July 1966), Gordon and Breach, New York and Dunod Paris (1967) 349-355.
- A. Solairaju & P. Muruganantham, Even Vertex Gracefulness of Fan Graph, International Journal of Computer Applications, Volume 8-No. 8, October 2010.
Index Terms
Keywords