On the vertex distinguishing equitable edge-coloring of graphs.
Zhongfu ZhangMu-chun LiBing YaoBaogen XuZhiwen WangJingwen LiPublished in: Ars Comb. (2008)
Keyphrases
- undirected graph
- vertex set
- weighted graph
- edge weights
- directed graph
- spanning tree
- minimum weight
- labeled graphs
- approximation algorithms
- random graphs
- minimum cost
- attributed graphs
- complex networks
- minimum spanning trees
- strongly connected
- graph structure
- graph theoretic
- graph matching
- edge information
- connected components
- directed acyclic graph
- edge detection
- graph clustering
- bipartite graph
- subgraph isomorphism
- multi objective
- graph model
- average degree
- hamiltonian cycle
- random walk
- shortest path
- graph construction
- graph theory
- graph representation
- graph partitioning
- graph mining