Open Journal of Discrete Mathematics

Volume 2, Issue 4 (October 2012)

ISSN Print: 2161-7635   ISSN Online: 2161-7643

Google-based Impact Factor: 0.64  Citations  

H- and H2-Cordial Labeling of Some Graphs

HTML  Download Download as PDF (Size: 123KB)  PP. 149-155  
DOI: 10.4236/ojdm.2012.24030    4,137 Downloads   7,154 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.

Cited by

No relevant information.

Copyright © 2024 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.