Open AccessSome Results on 2-odd Labeling of Graphs
Author(s) -
P. Abirami,
A. Parthiban,
N. Srinivasan
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.e7041.018520
Subject(s) - combinatorics , edge graceful labeling , mathematics , graph , integer (computer science) , graph labeling , discrete mathematics , computer science , graph power , line graph , programming language
A graph is said to be a 2-odd graph if the vertices of can be labelled with integers (necessarily distinct) such that for any two vertices which are adjacent, then the modulus difference of their labels is either an odd integer or exactly 2. In this paper, we investigate 2-odd labeling of some classes of graphs.