http://dx.doi.org/10.1007/s11766-011-2309-2">
 

Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

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

Language

English

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. © 2011 Editorial Committee of Applied Mathematics-A Journal of Chinese Universities and Springer-Verlag Berlin Heidelberg.

Keywords

Adjacent strong edge coloring, adjacent vertex-distinguishing acyclic edge coloring

Publication Date

2011

Source Publication Title

Applied Mathematics - A Journal of Chinese Universities

Volume

26

Issue

4

Start Page

439

End Page

452

Publisher

Springer Verlag

ISSN (print)

10051031

ISSN (electronic)

19930445

This document is currently not available here.

Share

COinS