Cordial Labeling of an Arbitrary Supersubdivision of a Graph

S. J. Gajjar¹

Section:Review Paper, Product Type: Journal-Paper
Vol.6 , Issue.1 , pp.241-244, Feb-2019

CrossRef-DOI:   https://doi.org/10.26438/ijsrmss/v6i1.241244

Online published on Feb 28, 2019

Copyright © S. J. Gajjar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

476 Views    270 Downloads    103 Downloads

Abstract :
In this paper, we have investigated a condition that if for a graph G there exist a binary vertex labeling f:V(G)?{0,1} such that e_f (0)=0 then an arbitrary supersubdivision of G, G×P_n, G×C_2n, splitting graph of G, disjoint union of graphs, path union of some graphs and a graph obtained by attaching m pendent edges to every vertex of the graph G are cordial

Key-Words / Index Term :
Graph Labeling, Cordial Labeling, An Arbitrary Suppersubdivision

References :
[1] J. Gross and J. Yellen (2004). Handbook of Graph Theory, CRC Press.
[2] D. M. Burton (2007). Elementary Number Theory. 6th ed.
[3] J. A. Gallian, “A Dynamic Survey of Graph Labeling," The Electronic Journal of Combinatorics, 17 (2014), # DS6
[4] I. Cahit, ”Cordial Graphs: A weaker version of graceful and harmonious Graphs", Ars Combinatoria, 23(1987), 201-207.
[5] Y S Ho, S M Lee and S C Shee, ”Cordial labeling of unicyclic graphs and generalized Petersen graphs", Congress. Numer.,68(1989), 109-122.
[6] M Andar, S Boxwala and N B Limaye, ”A Note on cordial labeling of multiple shells", Trends Math. (2002), 77-80.
[7] S K Vaidya, G V Ghodasara, Sweta Srivastav, V J Kaneria, ”Some new cordial graphs", Int. J. of Sci. Comp.,2(1)(2008), 81-92.
[8] S K Vaidya, Sweta Srivastav, G V Ghodasara, V J Kaneria, ”Cordial labeling for cycle with one chord and its related graphs", Indian J. of Math. and Math. Sciences, 4(2)(2008), 145-156.
[9] G Sethuraman and P Selvaraju, ”Gracefullness of arbitreary supersubdivision of graphs", Indian J. pure. appl. math., 32(7)(2001), 1059-1064.
[10] S K Vaidya, N. A. Dani, ”Cordial Labeling and Arbitrary SuperSubdivision of Some Graphs", International Journal of Information Science and Computer Mathematics, Vol. 2, 2010, no. 1, 51 - 60.
[11] S K Vaidya, K. K. Kanani, ”Some New Results on Cordial Labeling in the Context of Arbitrary Supersubdivision of Graph", Applied Mathematical Sciences, Vol. 4, 2010, no. 47, 2323 - 2329.