Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree.
Suil ODouglas B. WestPublished in: J. Graph Theory (2010)
Keyphrases
- directed graph
- vertex set
- weighted graph
- undirected graph
- spanning tree
- random graphs
- maximum cardinality
- real world graphs
- edge weights
- directed edges
- graph theoretic
- graph theory
- massive graphs
- spectral embedding
- graph model
- power law
- planar graphs
- graph mining
- graph databases
- series parallel
- normalized cut
- random walk
- nodes of a graph
- graph representation
- clustering coefficient
- graph clustering
- social networks
- edge map
- edge information
- directed acyclic graph
- graph matching
- input image
- semi supervised