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: | |
|---|---|
| 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 |