L(2,1) labeling of join of paths and cycles
Author & Affiliation:
Jaya Ambigavathi Ragavan (ambiga_27@yahoo.co.uk.)
Research Scholar Vinayaka Mission University, Salem
R.Sattanathan
Associate Professor D.G. Vaishnav College, Chennai - 600106 (INDIA)
Associate Professor D.G. Vaishnav College, Chennai - 600106 (INDIA)
Keyword:
L(2,1)-labeling, l-number, join of two graphs.
Issue Date:
April 2010
Abstract:
An L(2,1)-labeling of a graph G is an assignment of labels from {0,1,…,n} to the vertices of G such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart. The minimum span (difference between largest and smallest labels) taken over all L(2,1)-labeling of G is the l-number of G. The aim of this paper is to determine the l-number of the join of two graphs, Cm and Pn.
Pages:
123-126
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
J. A. Ragavan; R.sattanathan, "L(2,1) labeling of join of paths and cycles", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 123-126, 2018Copy the following to cite this URL:
J. A. Ragavan; R.sattanathan, "L(2,1) labeling of join of paths and cycles", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 1, Page Number 123-126, 2018Available from: https://www.ultrascientist.org/paper/1035/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
