Name
Abstract | ||
|---|---|---|
An L(2, 1)-labeling of a graph G = (V, E) is an assignment of non-negative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This article studies a generalization of the L(2, 1)-labeling. We assign sets with at least one element to vertices of G under some conditions. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.7151/dmgt.2077 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
L(2,1)-labeling | Discrete mathematics,Graph,Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
39 | 1 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roger K. Yeh | 1 | 521 | 38.16 |