Connected component: различия между версиями

'''Connected component''' — ''[[компонента связности]].''

A '''connected component''' of a [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> is a maximal [[connected graph|connected]] [[subgraph]] of <math>\,G</math>. Any two connected components of <math>\,G</math> are [[vertex disjoint graphs|vertex-disjoint]] and each [[vertex]] (and [[edge]]) belongs to one of them. Their number is denoted by <math>\,c(G)</math>.

 

 

* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.