INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016
open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15
Cycle Related Vertex Odd and Even Divisor Cordial Labeling for some Special Graphs
Authors Name:
Dhivya.E
, Arokia Lancy.A
Unique Id:
IJSDR1903077
Published In:
Volume 4 Issue 3, March-2019
Abstract:
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", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.4, Issue 3, page no.449 - 460, March-2019, Available :http://www.ijsdr.org/papers/IJSDR1903077.pdf
Downloads:
000337073
Publication Details:
Published Paper ID: IJSDR1903077
Registration ID:190202
Published In: Volume 4 Issue 3, March-2019
DOI (Digital Object Identifier):
Page No: 449 - 460
Publisher: IJSDR | www.ijsdr.org
ISSN Number: 2455-2631
Facebook Twitter Instagram LinkedIn