Connected hypergraph

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

Connected hypergraphсвязный гиперграф.

A hypergraph such that it is not representable as {\mathcal H}_{1} \cup
{\mathcal H}_{2}, where {\mathcal H}_{1}, {\mathcal H}_{2} are vertex-disjoint non-empty hypergraphs is called connected. Note that if \emptyset \in E({\mathcal H}), {\mathcal H} is not connected.

Литература

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