Graphs with all spanning trees nonisomorphic (Q1923474)
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 932519
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with all spanning trees nonisomorphic |
scientific article; zbMATH DE number 932519 |
Statements
Graphs with all spanning trees nonisomorphic (English)
0 references
23 March 1997
0 references
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.
0 references
spanning trees
0 references
0.8076844215393066
0 references
0.776214063167572
0 references
