Effect of edge-subdivision on vertex-domination in a graph.
Amitava BhattacharyaGurusamy Rengasamy VijayakumarPublished in: Discuss. Math. Graph Theory (2002)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- disjoint paths
- minimum weight
- strongly connected
- spanning tree
- graph structure
- random walk
- labeled graphs
- adjacency matrix
- connected components
- approximation algorithms
- directed acyclic graph
- structured data
- bipartite graph
- average degree
- random graphs
- graph representation
- minimum spanning tree
- multiresolution
- graph partitioning
- minimum cost
- data sets
- graph theoretic
- edge information
- complex networks
- social network analysis
- shortest path
- stable set
- hamiltonian cycle
- edge detection
- connected subgraphs
- subdivision scheme