Partitioning the vertices of a cubic graph into two total dominating sets.
Wyatt J. DesormeauxTeresa W. HaynesMichael A. HenningPublished in: Discret. Appl. Math. (2017)
Keyphrases
- vertex set
- weighted graph
- graph partitioning
- partitioning algorithm
- labeled graphs
- edge weights
- directed edges
- undirected graph
- spectral graph
- graph theory
- adjacency matrix
- random graphs
- minimum cut
- graph structure
- hamiltonian cycle
- maximum matching
- graph representation
- directed graph
- planar graphs
- spanning tree
- connected graphs
- random walk
- average degree
- strongly connected
- bipartite graph
- minimum weight
- normalized cut
- min cut
- graph databases
- graph clustering
- connected components
- b spline
- graph model
- betweenness centrality
- graph cuts
- connected subgraphs
- graph mining
- directed acyclic graph
- disjoint sets
- query graph
- graph based algorithm
- clustering algorithm