On Minimum Degree Implying That a Graph is H-Linked.
Ronald J. GouldAlexandr V. KostochkaGexin YuPublished in: SIAM J. Discret. Math. (2006)
Keyphrases
- graph theory
- bipartite graph
- spanning tree
- directed graph
- dependency graph
- random walk
- graph structure
- graph representation
- random graphs
- graph mining
- neural network
- minimum cut
- graph theoretic
- degree distribution
- graph model
- min sum
- connected components
- structured data
- dominating set
- clustering coefficient
- edge disjoint
- maximum flow
- constant factor
- adjacency matrix
- graph kernels
- minimum spanning tree
- edge weights
- minimum cost
- weighted graph
- pattern mining
- xml documents