I Circuits or edge-disjoint unions of circuits in a connected graph

cianfa72
Messages
2,784
Reaction score
293
TL;DR Summary
Evaluate the number of nonempty circuits or edge-disjoint unions of circuits in a connected graph
Hi,
I've a question related to the graph theory.

Take a connected graph with ##n## nodes and ##b## edges. We know there are ##m = b - n + 1## fundamental circuits.

Which is the total number of nonempty circuits or edge-disjoint unions of circuits ? If we do not take in account the circuit orientation I believe the answer is ##2^m - 1##.

Is the above correct ? Thanks.
 
Physics news on Phys.org
To be more specific consider the following graph with 2 nodes and 4 edges. We have 3 fundamental circuits, but which is the total number of circuits or edge-disjoint unions of circuits ?
appunti.jpg
 
A sphere as topological manifold can be defined by gluing together the boundary of two disk. Basically one starts assigning each disk the subspace topology from ##\mathbb R^2## and then taking the quotient topology obtained by gluing their boundaries. Starting from the above definition of 2-sphere as topological manifold, shows that it is homeomorphic to the "embedded" sphere understood as subset of ##\mathbb R^3## in the subspace topology.
Back
Top