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

'''Independence graph of a graph''' --- граф независимости графа. 

Maximum independent sets in <math>G</math> will be also called <math>\alpha</math>--sets in
<math>G</math>. The independence number <math>\alpha(G)</math> of a graph <math>G</math> is the
cardinality of an <math>\alpha</math>--set in <math>G</math>. Let <math>{\mathcal S}</math> be the set of
<math>\alpha</math>--sets of <math>G</math>. Then the '''independence graph''' <math>Ind(G)</math> of
<math>G</math> is the graph with <math>V(Ind(G)) = {\mathcal S}</math>, and <math>S_{1}, S_{2} \in
{\mathcal S}</math> are adjacent whenever <math>S_{1} \cap S_{2} = \emptyset</math>.