scientific article; zbMATH DE number 279643

From MaRDI portal
Publication:5289623





Let \(C(n,k)\) denote the number of labeled connected graphs of order \(n\) containing exactly \(k\) cycles. The expression of \(C(n,1)\) was found by \textit{A. Rényi} [Publ. Math. Inst. Hungar. Acad. Sci. 4, 385-388 (1959; Zbl 0092.403)]. In this paper new formulas for \(C(n,2)\) and \(C(n,3)\) are proposed and a formula found by the reviewer [Calcolo 9, 71-74 (1972; Zbl 0247.05143)] for the number of labeled connected graphs of order \(n\) containing \(k\) vertex-disjoint cycles is improved.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289623)