Cordial labeling of m-splitting graph of a graph

S J Gajjar, A K Desai


In this paper, we investigate a condition for a splitting graph of a graph, to be cordial. We have extended the concept of splitting graph to $m$-splitting graph of a graph and proved that the $m$-splitting graph of every cordial graph is cordial. We also prove that the splitting graph of $W_n$ is cordial for all $n\geqslant 3$, splitting graph of $K_n$ is cordial for $ n=t^2$ and $t^2\pm 2 $ and splitting graph of shadow graph of any graph is cordial.

Full Text:




bibitem{Gross} J. Gross and J. Yellen (2004). Handbook of Graph Theory, CRC Press.

bibitem{Burton} D. M. Burton (2007). Elementary Number Theory. 6th ed.

bibitem{Gallian} J. A. Gallian, ``A Dynamic Survey of Graph Labeling," {it{The Electronic Journal of Combinatorics}}, 17 (2014), # DS6

bibitem{cahit} I. Cahit, ``Cordial Graphs: A weaker version of graceful and harmonious Graphs",

{it Ars Combinatoria}, 23(1987), 201-207.

bibitem{Ho} Y S Ho, S M Lee and S C Shee, ``Cordial labeling of unicyclic graphs and

generalized Petersen graphs", {it Congress. Numer}.,68(1989), 109-122.

bibitem{Andar} M Andar, S Boxwala and N B Limaye, ``A Note on cordial labeling of

multiple shells", {it Trends Math}. (2002), 77-80.

bibitem{B} S K Vaidya, G V Ghodasara, Sweta Srivastav, V J Kaneria, ``Some new

cordial graphs", {it Int. J. of Sci. Comp}.,2(1)(2008), 81-92.

bibitem{C} S K Vaidya, Sweta Srivastav, G V Ghodasara, V J Kaneria, ``Cordial

labeling for cycle with one chord and its related graphs", {it Indian J. of

Math. and Math. Sciences}, 4(2)(2008), 145-156.

bibitem{Raj} P. Lawrence Rozario Raj, S. Koilraj, ``Cordial labeling for the splitting graph of some standard graphs", {it International journal of mathematics and soft computing},Vol.1, No.1 (2011), 105 - 114.



  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.