Journal Article

Some Results on 2-odd Labeling of Graphs

  • et al.
International Journal of Recent Technology and Engineering (IJRTE) (2020) 8(5) 5644-5646
DOI: 10.35940/ijrte.e7041.018520
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Abirami, P., Parthiban*, Dr. A., & Srinivasan, Dr. N. (2020). Some Results on 2-odd Labeling of Graphs. International Journal of Recent Technology and Engineering (IJRTE), 8(5), 5644–5646. https://doi.org/10.35940/ijrte.e7041.018520

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free