Two-cacti with minimum number of spanning trees
type: Item
instance of: scholarly article
title: Two-cacti with minimum number of spanning trees
zbMATH Open document ID: 0788.05026
DOI: 10.1016/0012-365X(92)00064-X
published in: Discrete Mathematics
publication date: 1994-05-15T00:00:00Z
review text: 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.
reviewed by: Bohdan Zelinka
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 500622
zbMATH Keywords: two-cactus
zbMATH Keywords: isomorphism
zbMATH Keywords: spanning trees
author: Preben Dahl Vestergaard
MaRDI profile type: Publication
cites work: Über Graphen mit isomorphen Gerüsten
cites work: Graphen, worin je zwei Gerüste isomorph sind
cites work: Q4052152
cites work: Q4204164
cites work: Spanning trees in a cactus
cites work: Q5606538
cites work: The graphs, all of whose spanning trees are isomorphic to each other
cites work: Q4187843
description: scientific article; zbMATH DE number 500622