Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree.
Aijun DongGuanghui WangJianghua ZhangPublished in: Discret. Appl. Math. (2014)
Keyphrases
- average degree
- undirected graph
- phase transition
- random walk
- network size
- small world networks
- approximation algorithms
- directed graph
- complex networks
- nearest neighbor
- weighted graph
- directed acyclic graph
- objective function
- connected components
- neural network
- adjacency matrix
- social networks
- constraint satisfaction
- scale free
- small world
- np complete
- minimum cost
- shortest path
- social network analysis
- pattern mining
- network structure