Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

Weifan Wang () and Yiqiao Wang
Additional contact information
Weifan Wang: Zhejiang Normal University
Yiqiao Wang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2010, vol. 19, issue 4, No 3, 485 pages

Abstract: Abstract An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ′ a (G). Let $\mathop{\mathrm{mad}}(G)$ and Δ denote the maximum average degree and the maximum degree of a graph G, respectively. In this paper, we prove the following results: (1) If $\mathop{\mathrm{mad}}(G)

Keywords: Adjacent vertex distinguishing edge-coloring; Graph; Maximum average degree; Maximum degree (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9178-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:19:y:2010:i:4:d:10.1007_s10878-008-9178-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-008-9178-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().