Ring perception: proof of a formula calculating the number of the smallest rings in connected graphs
A general mathematical proof of a formula proposed and used by Fan et al. for calculating the number of the smallest rings in their smallest set of the smallest rings search algorithm is reported. This proof generalizes this formula to all connected cyclic graphs.
Petitjean
M
Institut de Topologie et de Dynamique des Systemes, CNRS UPRES-A 7086, Universite Paris 7, France.
Fan
BT
Panaye
A
Doucet
JP