Distance two labeling on special family of graphs
<p>An L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of non-negative integers such that |f(x)-f(y)|\ge 2 if x and y are adjacent and |f(x)-f(y)|\ge 1 if x and y are at distance 2, for all x and y in V(G). A k-L(2,1)-labeling is an L(2,1)-labeling f:V(G)...
Main Author: | Muthali Murugan |
---|---|
Format: | Article |
Language: | English |
Published: |
Università degli Studi di Catania
2015-12-01
|
Series: | Le Matematiche |
Subjects: | |
Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/1147 |
Similar Items
-
L(2,1)-Labeling for Subdivisions of Cycle Dominated Graphs
by: Muthali Murugan
Published: (2015-01-01) -
The L(2,1)-Labeling of Some Middle Graphs
by: Devsi D. Bantva, et al.
Published: (2010-01-01) -
Radio Graceful Labelling of Graphs
by: Laxman Saha, et al.
Published: (2020-05-01) -
Labeling cacti with a condition at distance two
by: S. K. Vaidya, et al.
Published: (2011-06-01) -
L(3, 2, 1)-Labeling of Banana Trees
by: Murugan M., et al.
Published: (2019-12-01)