Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 8.14 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)
Assume H(V, E) be a finite simple graph. Let φ be a function from the edge set E to {0,1}. For every vertex vV , define φ (v) = Σ{ (uv): uvE}(mod 2). The function φ is called an E− cordial labeling of H, if the number of edges labeled 0 and the number of edges labeled 1 differs by at most one and the number of vertices labeled 0 and the number of vertices labeled 1 differs by at most one. A graph that admits E− cordial labeling is said to E - Cordial. In this incredibly interesting paper, we prove that Odd Snakes and c_m^((t)), that is one vertex union of t copies of Cm , for t –even and m – odd are E - Cordial.
Keywords:
Snakes, One vertex union of cycles, E - Cordial labeling, E - Cordial graphs.
Cite Article:
"MISSION CRITICAL MIRACLES ON E-CORDIAL GRAPHS", International Journal of Science & Engineering Development Research (www.ijrti.org), ISSN:2455-2631, Vol.3, Issue 10, page no.60 - 63, October-2018, Available :http://www.ijrti.org/papers/IJRTI1810011.pdf
Downloads:
000205160
ISSN:
2456-3315 | IMPACT FACTOR: 8.14 Calculated By Google Scholar| ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.14 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator