Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees. (Q2856915)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6221243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees. |
scientific article; zbMATH DE number 6221243 |
Statements
30 October 2013
0 references
spanning tree
0 references
Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees. (English)
0 references
The authors consider the following problem: what is the smallest graphs (either in terms of the number of vertices, or of the number of edges), which contains exactly a given number of spanning trees. This problem was first considered in [\textit{J. Sedláček}, Can. Math. Bull. 13, 515--517 (1970; Zbl 0202.23501)]. Here, some new bounds on problem are obtained. The central part of the paper comes from explicitly constructed graphs whose number of spanning trees can be controlled.
0 references
0.7616122364997864
0 references
0.7578397989273071
0 references
0.7549163103103638
0 references
