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.
Recommendations
Cited in
(16)- The number of labeled outerplanar k-cyclic graphs
- On the number of labeled outerplanar \(k\)-cycle blocks
- Enumeration of labeled bicyclic and tricyclic Eulerian graphs
- Enumeration of labeled and unlabeled Hamiltonian cycles in complete k-partite graphs
- On the number of increasing paths in labeled cycles and stars
- The number of connected graphs with k cycles on labeled nodes
- Sum labellings of cycle hypergraphs
- k-Combinations of an unlabelled graph
- The number of labeled connected graphs modulo prime powers
- Enumeration of labeled connected graphs with given order and size
- scientific article; zbMATH DE number 4128839 (Why is no real title available?)
- scientific article; zbMATH DE number 638669 (Why is no real title available?)
- scientific article; zbMATH DE number 1424850 (Why is no real title available?)
- Enumeration of labeled outerplanar bicyclic and tricyclic graphs
- An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs
- The number of n-cycles in a graph
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)