Block graph: различия между версиями

Материал из WEGA
Перейти к навигации Перейти к поиску
Нет описания правки
Нет описания правки
Строка 1: Строка 1:
'''Block graph''' --- блоковый граф.  
То же, что  [[Граф блоков]].


A graph <math>G</math> is a '''block graph''' if <math>G</math> is connected and every maximal 2-connected
A graph <math>G</math> is a '''block graph''' if <math>G</math> is connected and every maximal 2-connected
subgraph (i.e., a ''block'') is complete (i.e., a ''clique''. Another name is
subgraph (i.e., a ''block'') is complete (i.e., a ''clique''. Another name is
'''completed Husimi tree'''.
'''completed Husimi tree'''.
[[Категория:Неориентированные графы]]

Версия от 13:56, 25 февраля 2011

То же, что Граф блоков.

A graph [math]\displaystyle{ G }[/math] is a block graph if [math]\displaystyle{ G }[/math] is connected and every maximal 2-connected subgraph (i.e., a block) is complete (i.e., a clique. Another name is completed Husimi tree.