Two-cacti with minimum number of spanning trees (Q1313842)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-cacti with minimum number of spanning trees |
scientific article; zbMATH DE number 500622
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-cacti with minimum number of spanning trees |
scientific article; zbMATH DE number 500622 |
Statements
Two-cacti with minimum number of spanning trees (English)
0 references
15 May 1994
0 references
A cactus is an undirected graph which contains at least one circuit and in which any two circuits have at most one vertex in common. A two-cactus is a cactus which contains exactly two circuits. The number of isomorphism classes of spanning trees of two-cacti is studied. Four constructions of two-cacti are described. It is proved that there are exactly three isomorphism classes of spanning trees of a two-cactus \(G\) if and only if \(G\) is obtained by one of the described constructions.
0 references
two-cactus
0 references
isomorphism
0 references
spanning trees
0 references
