Research ArticleOpen AccessGoogle Scholar indexed
H- and H<sub>2</sub>-Cordial Labeling of Some Graphs
Department of Mathematics, Scott Christian College, Nagercoil, India
Department of Mathematics, Scott Christian College, Nagercoil, India
- 1 Department of Mathematics, Scott Christian College, Nagercoil, India
- 2 Department of Mathematics, Scott Christian College, Nagercoil, India
Open Journal of Discrete Mathematics·Volume 02 (2012)·Pages 149–155·Published 31 October 2012·DOI10.4236/ojdm.2012.24030
Copy link · social · email
Abstract
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tensor product are H 2 -cordial labeling. Further we prove that the join of two wheel graphs Wn and Wm, (mod 4) admits a H-cordial labeling.
KeywordsH-CordialH<sub>2</sub>-CordialJoin of Two GraphsSplit Graphs
- I. Cahit, “H-Cordial Graphs,” Bulletin of the Institute of Combinatorics and Its Applications, Vol. 18, 1996, pp. 87-101.
- M. Ghebleh and R. Khoeilar, “A Note on ‘H-Cordial Graphs,’” Bulletin of the Institute of Combinatorics and Its Applications, Vol. 31, 2001, pp. 60-68.
- J. A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronics Journal of Combinations, Vol. 17, 2010, #DS6.
- D. B. West, “Introduction to Graph Theory,” Prentice-Hall of India Pvt. Ltd., Delhi, 2001.