On sum edge-coloring of regular, bipartite and split graphs.
Petros A. PetrosyanRafael R. KamalianPublished in: Discret. Appl. Math. (2014)
Keyphrases
- undirected graph
- weighted graph
- graph model
- vertex set
- bipartite graph
- graph partitioning
- edge weights
- spanning tree
- directed graph
- graph structure
- edge detection
- minimum spanning trees
- connected components
- graph theoretic
- random graphs
- edge information
- directed acyclic graph
- adjacency matrix
- minimum cost
- complex networks
- series parallel
- square error
- strongly connected
- genetic algorithm
- graph structures
- graph matching
- edge detector
- optimal solution
- objective function