Graphs with vertex-coloring and detectable 2-edge-weighting.
Nagarajan ParamaguruRathinasamy SampathkumarPublished in: AKCE Int. J. Graphs Comb. (2016)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- labeled graphs
- complex networks
- approximation algorithms
- spanning tree
- strongly connected
- minimum weight
- graph structure
- connected components
- directed acyclic graph
- attributed graphs
- maximum cardinality
- average degree
- minimum cost
- neural network
- hamiltonian cycle
- random graphs
- graph structures
- shortest path
- weighting scheme
- graph representation
- minimum spanning trees
- minimum spanning tree
- tf idf
- edge detection
- edge detector