Connected component of a hypergraph
Connected component of a hypergraph — связная компонента гиперграфа.
Let be a hypergraph. A sequence of distinct hyperedges is a path of length if for all . Two vertices are connected (by the path ), and and are also connected. A set of hyperedges is connected if every pair of hyperedges in the set is connected. A connected component of a hypergraph is a maximal connected set of hyperedges.
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.