H- and H2-Cordial Labeling of Some Graphs

DOI: 10.4236/ojdm.2012.24030   PDF   HTML     3,452 Downloads   5,807 Views   Citations

Abstract

In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tensor product are H2-cordial labeling. Further we prove that the join of two wheel graphs Wn and Wm, (mod 4) admits a H-cordial labeling.

Share and Cite:

F. Selvanayagom and R. Chellathurai, "H- and H2-Cordial Labeling of Some Graphs," Open Journal of Discrete Mathematics, Vol. 2 No. 4, 2012, pp. 149-155. doi: 10.4236/ojdm.2012.24030.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] I. Cahit, “H-Cordial Graphs,” Bulletin of the Institute of Combinatorics and Its Applications, Vol. 18, 1996, pp. 87-101.
[2] 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.
[3] J. A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronics Journal of Combinations, Vol. 17, 2010, #DS6.
[4] D. B. West, “Introduction to Graph Theory,” Prentice-Hall of India Pvt. Ltd., Delhi, 2001.

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.