Просмотр кода страницы Fundamental set of cutsets

'''Fundamental set of cutsets''' --- фундаментальная система разрезов.

Let <math>T</math> be a ''spanning tree'' of a connected graph <math>G</math>. Any edge
of <math>T</math> defines a partition of the vertices of <math>G</math>, since its removal
disconnects <math>T</math> into two components. There will be a corresponding
cut-set of <math>G</math> producing the same partition of vertices. This cut-set
contains precisely one edge and a number ''chord'' of <math>T</math>. This
cut-set is called a '''fundamental cut-set''' of <math>G</math> with respect to
<math>T</math>. For the graph <math>G</math> and spanning tree <math>T</math>, a corresponding '''set of fundamental cut-sets''' and some other cut-sets can be expressed as linear
ring-sums of fundamental cut-sets.