Some Results on 2-odd Labeling of Graphs
P. Abirami1, A. Parthiban2, N. Srinivasan3
1P. Abirami, Research Scholar, Department of Mathematics, St. Peter’s Institute of Higher Education and Research, Avadi, Chennai-600 054, Tamil Nadu, India.
2Dr. A. Parthiban*, Assistant Professor, Department of Mathematics, School of Chemical Engineering and Physical Sciences, Lovely Professional University, Phagwara-144 411, Punjab, India.
3Dr. N. Srinivasan, Professor and Head, Department of Mathematics, St. Peter’s Institute of Higher Education and Research, Avadi, Chennai-600 054, Tamil Nadu, India.
Manuscript received on January 08, 2020. | Revised Manuscript received on January 31, 2020. | Manuscript published on January 30, 2020. | PP: 5644-5646 | Volume-8 Issue-5, January 2020. | Retrieval Number: E7041018520/2020©BEIESP | DOI: 10.35940/ijrte.E7041.018520
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Distance Graphs, 2-odd Graphs.
Scope of the Article: Graph Algorithms And Graph Drawing