title: Ring perception: proof of a formula calculating the number of the smallest rings in connected graphs
abstract: 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.
authors.affiliation: Institut de Topologie et de Dynamique des Systemes, CNRS UPRES-A 7086, Universite Paris 7, France.
authors.initials: M
authors.lastname: Petitjean
authors.initials: BT
authors.lastname: Fan
authors.initials: A
authors.lastname: Panaye
authors.initials: JP
authors.lastname: Doucet