๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The numbers of spanning trees of the cubic cycle CN3 and the quadruple cycle CN4

โœ Scribed by Xue-rong Yong; Talip Acenjian

Book ID
108316061
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
171 KB
Volume
169
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Number of Cycles in 3-Connected C
On the Number of Cycles in 3-Connected Cubic Graphs
โœ R.E.L Aldred; Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie