Minimum degree condition for a graph to be knitted.
Runrun LiuMartin RolekGexin YuPublished in: Discret. Math. (2019)
Keyphrases
- spanning tree
- directed graph
- random graphs
- sufficient conditions
- bipartite graph
- structured data
- weighted graph
- graph model
- minimum cut
- graph representation
- graph structure
- directed acyclic graph
- small world
- graph partitioning
- minimum cost
- graph theory
- random walk
- dominating set
- data sets
- edge disjoint
- min sum
- degree distribution
- graph structures
- graph construction
- minimum spanning tree
- graph theoretic
- clustering algorithm
- neural network