Neighbourhood Cordial and Neighbourhood Product Cordial Labeling of Graphs

A. Muthaiyan; G. Bhuvaneswari

doi:https://doi.org/10.14445/22315373/IJMTT-V27P511

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 27 | Number 2 | Year 2015 | Article Id. IJMTT-V27P511 | DOI : https://doi.org/10.14445/22315373/IJMTT-V27P511

Neighbourhood Cordial and Neighbourhood Product Cordial Labeling of Graphs

A. Muthaiyan, G. Bhuvaneswari

Abstract

In this paper, we introduce the various types of neighbourhood cordial labeling of graphs and present the neighbourhood cordial labeling of kP2, kPn.

Keywords

Neighbourhood cordial graph, Total neighbourhood cordial graph, Neighbourhood product cordial graph, Total neighbourhood cordial graph.

References

[1] I. Cahit, “Cordial graphs: A weaker version of graceful and harmonious graphs”, Ars Combinatoria, Vol 23, pp. 201-207, 1987.
[2] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16, # DS6, 2013.
[3] F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1972.
[4] A. Muthaiyan and G. Bhuvaneswari, Some more results on neighbourhood cordial and neighbourhood product cordial labeling of graphs, communicated.
[5] M. Sundaram, M. Ponraj and S. Somsundaram, Product Cordial Labeling of Graphs, Bull. Pure and Applied Sciences (Mathematics and Statistics), 23E, pp 155-163, 2004.
[6] M. Sundaram, R. Ponraj, and S. Somasundram, Total product cordial labeling of graphs, Bull. Pure Appl. Sci. Sect. E Math. Stat., 25, pp 199-203, 2006.

Citation :

A. Muthaiyan, G. Bhuvaneswari, "Neighbourhood Cordial and Neighbourhood Product Cordial Labeling of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 27, no. 2, pp. 58-64, 2015. Crossref, https://doi.org/10.14445/22315373/IJMTT-V27P511