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 journalArticlepeer-review

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 uv ∈ E(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.

Original languageEnglish
Pages (from-to)439-452
Number of pages14
JournalApplied Mathematics
Volume26
Issue number4
DOIs
Publication statusPublished - Dec 2011

Scopus Subject Areas

  • Applied Mathematics

User-Defined 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.

Cite this