Graphs with all spanning trees nonisomorphic
type: Item
instance of: scholarly article
title: Graphs with all spanning trees nonisomorphic
zbMATH Open document ID: 0858.05030
DOI: 10.1016/0012-365X(94)00363-N
author: Lars Døvling Andersen
author: Preben Dahl Vestergaard
published in: Discrete Mathematics
publication date: 1997-03-23T00:00:00Z
review text: If a connected graph \(G\) with at least two vertices has the property that all its spanning trees are pairwise nonisomorphic, then every end-block of \(G\) has just one edge. This is one of the main results of this paper. By an easy construction it is shown that any graph is an induced subgraph of a connected graph without two distinct isomorphic spanning trees. Generalizations of this construction lead to some related results.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 932519
zbMATH Keywords: spanning trees
reviewed by: Johann Linhart
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: Non-separating induced cycles in graphs
cites work: Graphs with one isomorphism class of spanning unicyclic graphs
cites work: Q4204164
cites work: Graphs with two isomorphism classes of spanning unicycle subgraphs
cites work: The graphs, all of whose spanning trees are isomorphic to each other
full work available at URL: 0012-365x(94)00363-n
OpenAlex ID: W2087212786
description: scientific article; zbMATH DE number 932519