On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

Wai Chee SHIU, Wai Hong CHAN, Zhong-fu ZHANG, Liang BIAN

Research output: Contribution to journalArticles

2 Citations (Scopus)

Abstract

A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uvE(G). The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by x′ Aa (G), is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures. Copyright © 2011 Editorial Committee of Applied Mathematics-A Journal of Chinese Universities and Springer-Verlag Berlin Heidelberg.
Original languageEnglish
Pages (from-to)439-452
JournalApplied Mathematics
Volume26
Issue number4
DOIs
Publication statusPublished - Dec 2011

Citation

Shiu, W. C., Chan, W. H., Zhang, Z-F., & Bian, L. (2011). On the adjacent vertex-distinguishing acyclic edge coloring of some graphs. Applied Mathematics, 26(4), 439-452. doi: 10.1007/s11766-011-2309-2

Keywords

  • Adjacent strong edge coloring
  • Adjacent vertex-distinguishing acyclic edge coloring

Fingerprint Dive into the research topics of 'On the adjacent vertex-distinguishing acyclic edge coloring of some graphs'. Together they form a unique fingerprint.