Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree.
Weifan WangYiqiao WangPublished in: J. Comb. Optim. (2010)
Keyphrases
- average degree
- undirected graph
- phase transition
- random walk
- small world networks
- graph coloring
- directed graph
- network size
- approximation algorithms
- complex networks
- connected components
- spanning tree
- vertex set
- directed acyclic graph
- minimum cost
- adjacency matrix
- weighted graph
- social networks
- graph structure
- markov chain