Volume : IV, Issue : VIII, August - 2014
Path Related Cup Cordial Graphs
Dr. A. Nellai Murugan, P. Iyadurai Selvaraj
Abstract :
Let G = (V,E) be a graph with p vertices and q edges. A Cup (V) cordial labeling of a Graph G with vertex set V is a bijection from V to {0,1} such that if each edge uv is assigned the label with the condition the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits a V cordial labeling is called a V cordial graph (CCG). In this paper, we proved that Path Pn, Fan Fn(n : even), and Pn K1 are V cordial graphs.
Keywords :
Article:
Download PDF
DOI : 10.36106/ijar
Cite This Article:
A. NELLAI MURUGAN, P. IYADURAI SELVARAJ Path Related Cup Cordial Graphs Indian Journal of Applied Research, Vol.4, Issue.8 August 2014
Number of Downloads : 729
A. NELLAI MURUGAN, P. IYADURAI SELVARAJ Path Related Cup Cordial Graphs Indian Journal of Applied Research, Vol.4, Issue.8 August 2014
Our Other Journals...
-
International Journal of
Scientific Research Visit Website -
PARIPEX Indian Journal
of Research Visit Website -
Global Journal for
Research Analysis Visit Website