Adjacent Vertex Distinguishing Proper Edge Colorings of Bicyclic Graphs
An adjacent vertex distinguishing proper edge coloring of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors. Let x'a(G) be the minimum number of colors required to give G an adjacent vertex distinguishing proper edge coloring. In this p...
Saved in:
Published in | IAENG international journal of applied mathematics Vol. 48; no. 4; pp. 1 - 11 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Hong Kong
International Association of Engineers
01.11.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!