A new technique for the characterization of graphs with a maximum number of spanning trees
type: Item
instance of: scholarly article
title: A new technique for the characterization of graphs with a maximum number of spanning trees
zbMATH Open document ID: 0993.05119
DOI: 10.1016/S0012-365X(01)00095-4
author: O. Diekmann
published in: Discrete Mathematics
publication date: 2002-05-21T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 1743035
zbMATH Keywords: spanning trees
zbMATH Keywords: \(t\)-optimal graphs
zbMATH Keywords: characterizations
zbMATH Keywords: degree sequence
zbMATH Keywords: multipartite graphs
MaRDI profile type: Publication
full work available at URL: s0012-365x(01)00095-4
OpenAlex ID: W2077157637
Recommended article: On the characterization of graphs with maximum number of spanning trees
Recommended article: Q4894608
Recommended article: A new upper bound on the number of spanning trees of a graph
Recommended article: Maximizing the Number of Spanning Trees in a Connected Graph
Recommended article: The maximum number of spanning trees of a graph with given matching number
Recommended article: On numbers of vertices of maximum degree in the spanning trees of a graph
Recommended article: A limit characterization for the number of spanning trees of graphs
Recommended article: Maximizing spanning trees in almost complete graphs
Recommended article: On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
description: scientific article; zbMATH DE number 1743035