K-Connected graph

Материал из WikiGrapp
Перейти к:навигация, поиск

\,k-Connected graph\,k-связный граф.

A graph \,G is \,k-connected if there exist \,k internally node-disjoint chains between every pair of distinct nodes in \,G. A \,k-connected graph \,G is minimal if for any edge \,e \in E, \,G - e is not \,k-connected. Usually, \,2-connected graphs are called biconnected graphs and \,3-connected graphs are called triconnected graphs.

Литература

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