Name
Abstract | ||
|---|---|---|
A proper edge coloring of a graph G is strict neighbor-distinguishing if for any two adjacent vertices u and v, the set of colors used on the edges incident to u and the set of colors used on the edges incident to v are not included with each other. The strict neighbor-distinguishing index of G is the minimum number chi(snd)' (G) of colors in a strict neighbor-distinguishing edge coloring of G. In this paper, we prove that every connected subcubic graph G with delta(G) >= 2 has chi(snd)' (G) <= 7, and moreover chi(snd)' (G) - 7 if and only if G is a graph obtained from the graph K-2,K-3 by inserting a 2-vertex into one edge. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00373-020-02246-w | GRAPHS AND COMBINATORICS |
Keywords | DocType | Volume |
Strict neighbor-distinguishing edge coloring, Strict neighbor-distinguishing index, Subcubic graph | Journal | 37 |
Issue | ISSN | Citations |
1 | 0911-0119 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gu Jing | 1 | 37 | 7.42 |
| Weifan Wang | 2 | 868 | 89.92 |
| Yiqiao Wang | 3 | 494 | 42.81 |
| Ying Wang | 4 | 0 | 0.34 |