Просмотр кода страницы Bihypergraph

'''Bihypergraph''' — ''[[бигиперграф]].'' 

Let <math>\,H^{0}</math> and <math>\,H^{1}</math> be [[hypergraph|hypergraphs]] with the same [[vertex]] set <math>\,V</math>.
An ordered pair <math>\,H = (H^{0},H^{1})</math> is called a '''bihypergraph'''
with the set of [[edge|0-edges]] <math>\,E(H^{0})</math> and the set of 1-edges <math>\,E(H^{1})</math>.
Every hyperedge of either <math>\,H^{0}</math> or <math>\,H^{1}</math> is considered as a
hyperedge of <math>\,H</math>. The order of <math>\,H</math> is <math>\,n(H) = |V|</math>. The [[rank of a graph|rank]] of <math>\,H</math>
is <math>\,r(H) = \max\{r(H^{0}), r(H^{1})\}</math>.

A bihypergraph <math>\,H = (H^{0}, H^{1})</math> is called '''[[bipartite graph|bipartite]]''' if there
exists an ordered partition <math>V^{0} \cup V^{1} = V(H)</math> (bipartition)
such that  the set <math>\,V^{i}</math> is ''stable'' in <math>\,H^{i}</math>, <math>\,i = 0,1</math>.
==Литература==

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