Category:Bicomponents

From InterSciWiki

Revision as of 16:07, 5 April 2009 by Douglas R. White (Talk | contribs)
(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)
Jump to: navigation, search

Bicomponents are a special case of Structural cohesion in a graph: a maximal connected subgraph that cannot be disconnected by removal of two or fewer nodes and in which every pair of node is connected by two or more paths that share no intermediate nodes.