On the adjacent vertex distinguishing proper edge colorings of several classes of complete 4-partite and 5-partite graphs
- 10.2991/isccca.2013.32How to use a DOI?
- complete 4-partite graphs, complete 5-partite graphs, proper edge coloring, adjacent vertex-distinguishing proper edge coloring
A proper k-edge coloring of a graph G is an assignment of k colors, 1; 2; · · · ; k, to edges of G. For a proper edge coloring f of G and any vertex x of G, we use S(x) denote the set of the colors assigned to the edges incident to x. If for any two adjacent vertices u and v of G,we have S(u) = S(v), then f is called the adjacent vertex distinguishing proper edge coloring of G (or AVDPEC of G in brief). The minimum number of colors required in an AVDPEC of G is called the adjacent vertex distinguishing proper edge chromatic number of G, denoted by Xa(G). In this paper, adjacent vertex distinguishing proper edge chromatic numbers of several classes of complete 4-partite and 5-partite graphs are obtained.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Xiang-en Chen AU - Chunyan Ma AU - Fang Yang AU - Bing Yao PY - 2013/02 DA - 2013/02 TI - On the adjacent vertex distinguishing proper edge colorings of several classes of complete 4-partite and 5-partite graphs BT - Proceedings of the 2nd International Symposium on Computer, Communication, Control and Automation (ISCCCA 2013) PB - Atlantis Press SP - 128 EP - 131 SN - 1951-6851 UR - https://doi.org/10.2991/isccca.2013.32 DO - 10.2991/isccca.2013.32 ID - Chen2013/02 ER -