Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five.
Hervé HocquardMickaël MontassierPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- bayesian networks
- undirected graph
- vertex set
- random graphs
- edge weights
- directed graph
- weighted graph
- labeled graphs
- attributed graphs
- graph structure
- minimum cost
- hamiltonian cycle
- approximation algorithms
- spanning tree
- complex networks
- connected components
- directed acyclic graph
- edge detection
- minimum spanning trees
- graph theory
- bipartite graph
- graph matching
- pattern recognition
- minimum weight
- strongly connected
- connected subgraphs
- average degree
- graph clustering
- graph theoretic
- edge information
- graph construction
- graph partitioning
- genetic algorithm
- graph model