Cluster graph: различия между версиями
Перейти к навигации
Перейти к поиску
KVN (обсуждение | вклад) (Новая страница: «'''Сluster graph''' (''кластерный граф'') is a graph formed from the disjoint union of complete graphs (or cliques). Equivalently, a graph is a cluster graph if and only if it has no '''three-vertex induced path''' (i.e. three-vertex path as an induced subgraph) '''''P''<sub>3</sub>'''; for this reason, the cluster graphs are also called '''''P''<su...») |
(нет различий)
|
Версия от 09:04, 21 ноября 2024
Сluster graph (кластерный граф) is a graph formed from the disjoint union of complete graphs (or cliques). Equivalently, a graph is a cluster graph if and only if it has no three-vertex induced path (i.e. three-vertex path as an induced subgraph) P3; for this reason, the cluster graphs are also called P3-free graphs. The cluster graphs are the graphs for which adjacency is an equivalence relation, and their connected components are the equivalence classes for this relation.