Chengchao Yan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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). We prove that χ ′ a (G) is at most the maximum degree plus 2 if G(More)
  • 1