Просмотр кода страницы Deficiency of a bipartite graph

'''Deficiency of a bipartite graph''' --- дефицит двудольного графа. 

For a vertex <math>v</math>, the '''deficiency of a bipartite graph''' <math>D(v)</math> is a set of pairs defined
by <math>D(v) = \{(x,y)| v \in N(x), v \in N(y), x \not \in N(y), x \neq
y\}</math>. So a vertex <math>v</math> is ''simplicial'' if <math>D(v) = \emptyset</math>.

For an edge <math>(x,y)</math>, the '''deficiency of a bipartite graph''' is the set of pairs defined by
<math>D(x,y) = \{(a,b)| a, b \in N(x) \cup N(y), (a,b) \not \in E\}</math>. So an
edge <math>(x,y)</math> is ''bisimplicial'' if <math>D(x,y) = \emptyset</math>.

Here <math>N(v)</math> denotes a ''neighbourhood'' of <math>v</math>.