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

'''Independent circuits''' --- независимые циклы. 

A set <math>{\mathcal C}</math> of ''circuits'' of <math>G</math> is called '''independent'''
if for every nonempty subset <math>{\mathcal A}</math> of <math>{\mathcal C}</math> the symmetric
difference of the circuits in <math>{\mathcal A}</math> is not empty. A maximal
independent set of circuits of <math>G</math> is called a '''cycle basis''' of
<math>G</math>. It is easy to see that every cycle basis of <math>G</math> has <math>|E(G)| - |V(G)|
+ c(G)</math> circuits, where <math>c(G)</math> is the number of components of <math>G</math>. 
==See also==
*''Cyclomatic number''.