Cycle Related Vertex Odd and Even Divisor Cordial Labeling for some Special Graphs
Dhivya.E
, Arokia Lancy.A
labeling, cordial labeling, divisor cordial labeling, vertex odd divisor cordial labeling, vertex even divisor cordial labeling
A vertex divisor cordial labeling of a graph G = (V,E) is a bijection f : V → {1,2,3,...2n-1} if odd and f : V → {1,2,3,...2n} if even such that if each edge uv is assigned the label 1 if f(u)/ f(v) or f(v)/ f(u) and the label 0 if f(u) does not divide f(v) then |ef(0) − ef(1)| ≤ 1 where ef(0) is the number of edges with label 0 and ef(1) is the number of edges with label 1. A graph which admits vertex even divisor cordial labeling is called even divisor cordial graph. In this paper we proved that splitting of Friendship graph S’(Fn), splitting of helm graph S’(Hn) ,web graph Wbn and umbrella graph U(m,n) ,(m=n+1) admits odd and even divisor cordial labeling. The gear graph Gn, switching of an apex vertex in S(k1,n), the graph P2 + mK1, 1-weak shell graph C(n,n − 3), 2-weak shell graph C(n,n − 4) admits even divisor cordial labeling.
"Cycle Related Vertex Odd and Even Divisor Cordial Labeling for some Special Graphs", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.4, Issue 3, page no.449 - 460, March-2019, Available :https://ijsdr.org/papers/IJSDR1903077.pdf
Volume 4
Issue 3,
March-2019
Pages : 449 - 460
Paper Reg. ID: IJSDR_190202
Published Paper Id: IJSDR1903077
Downloads: 000347175
Research Area: Applied Mathematics
Country: Coimbatore, Tamilnadu, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
