A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected.
Yoshimi EgawaMasao TsugakiPublished in: Australas. J Comb. (2005)
Keyphrases
- connected components
- graph model
- graph representation
- graph structure
- graph theoretic
- graph theory
- graph based algorithm
- dependency graph
- graph search
- structured data
- directed graph
- markov chain
- random walk
- weighted graph
- bipartite graph
- graph mining
- link analysis
- database
- binary images
- worst case
- search algorithm
- knowledge base
- data sets
- real time