Graphs with an extremal number of spanning trees

DOI10.1002/JGT.3190040115MaRDI QIDQ3882479zbMATH OpenOpenAlexFDO

Authors Alexander Kelmans

Publication date 1980

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190040115

zbMATH Keywords

maximalminimalnumber of spanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited in

(5)

• Laplacian spectra and spanning trees of threshold graphs
• Maximal determinant knots
• On graphs with randomly deleted edges
• On a conjecture of regular graphs having the minimum number of induced paths of length two
• On bipartite graphs with the minimum number of spanning trees

This page was built for publication: Graphs with an extremal number of spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3882479)