Such a circuit, formed by adding a chord to a spanning tree, is called aamp; fundamental circuit. How many fundamental circuits does a graph have? Exactly as many as the number of chords, // (= e a n + k). How many circuits does a graph have inanbsp;...
|Title||:||Graph Theory with Applications to Engineering and Computer Science|
|Publisher||:||PHI Learning Pvt. Ltd. - 2004-10-01|