Cordial labeling for the splitting graph of some standard graphs

P Lawrence Rozario Raj, S Koilraj

Abstract


In this paper we prove that the splitting graph of path Pn, cycle Cn, complete bipartite graph Km,n, matching Mn, wheel Wn and are cordial.

Full Text:

PDF

Refbacks

  • 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.