Cordial Labeling for the Splitting Graph of some Standard Graphs

Autor:	P Lawrence Rozario Raj, S Koilraj
Rok vydání:	2011
Předmět:	Factor-critical graph Discrete mathematics Combinatorics Edge-transitive graph law Outerplanar graph Line graph Voltage graph Wheel graph Complete bipartite graph Simplex graph law.invention Mathematics
Zdroj:	International Journal of Mathematics and Soft Computing. 1:89
ISSN:	2319-5215 2249-3328
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::ba167337d128893ace54c7a7f7861bf2 https://doi.org/10.26708/ijmsc.2011.1.1.10 Zobrazit plný text záznamu