Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree |
| |
Authors: | Weifan Wang Yiqiao Wang |
| |
Institution: | 1.Department of Mathematics,Zhejiang Normal University,Jinhua,China |
| |
Abstract: | An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for
an adjacent vertex distinguishing edge-coloring of G is denoted by χ′
a
(G). Let
mad(G)\mathop{\mathrm{mad}}(G)
and Δ denote the maximum average degree and the maximum degree of a graph G, respectively. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|