7-cordial labeling of standard graphs
Abstract
We contribute here some standard results for 7-cordial labeling. It has been proved that fans, friendship graphs,ladders, double fans, double wheels admit 7-cordial labeling.
About this article
Keywords
- Abelian Group
- 7-Cordial Labeling.
References
[1] J A Gallian, A dynamic survey of graph labeling, The Electronics Journal of Combinatorics, 16(2013) ]DS6.
[2] J Gross and J Yellen, Handbook of graph theory, CRC Press, (2004).
[3] M. Hovey, A-cordial graphs, Discrete Math.,Vol 93,183-194 (1991).
[4] M. Z. Youssef, On k-cordial labeling, Australas. J. Combin.,Vol 43,31-37 (2009).
[5] R. L. Graham and N. J. A. Sloane, On additive bases and harmonious graphs, SIAM J. Alg. Discrete Methods, 1 (1980)382-404.
View more references (1)
[6] R. Tao, On k-cordiality of cycles, crowns and wheels, Systems Sci. Math. Sci., 11 (1998)227-229.