On Sufficient Degree Conditions for a Graph to be k-linked.
Ken-ichi KawarabayashiAlexandr V. KostochkaGexin YuPublished in: Comb. Probab. Comput. (2006)
Keyphrases
- graph structure
- graph representation
- sufficient conditions
- random walk
- environmental conditions
- graph theoretic
- degree distribution
- directed acyclic graph
- random graphs
- directed graph
- graph properties
- clustering coefficient
- weighted graph
- graph theory
- structured data
- real time
- graph model
- graph partitioning
- bipartite graph
- minimum spanning tree
- graph structures
- mobile robot
- database