CORDIALITY IN THE PATH UNION OF VERTEX SWITCHING OF CYCLES IN INCREASING ORDER
Print ISSN: 0972-7752 | Online ISSN: | Total Downloads : 99
DOI:
Author :
J. Jeba Jesintha (PG Department of Mathematics, Womens Christian College, Chennai, INDIA)
K. Subashini (Department of Mathematics, Jeppiaar Engineering College, Chennai, INDIA)
Abstract
The Cordial labeling of a graph G is a function f : V (G)→ {0,1} such that each edge uv in G is assigned the label |f(u)-f(v)| with the property |vf (0) - vf (1)|≤ 1 and |ef*(0)-ef*(1)|≤1, where vf (i) for i = 0, 1 denote the number of vertices with label i and ef*(i) for i = 0, 1 denote the number of edges with label i. The graph which admits cordial labeling is called the Cordial graph. In this paper, we prove that the path union of vertex switching of cycles in increasing order is cordial.
Keywords and Phrases
Cordial labeling, Path union, Vertex switching.
A.M.S. subject classification
05C78.
.....
![](img/pdf_file_icon_32x32.png)