scientific article; zbMATH DE number 1439503

MaRDI QIDQ4949882zbMATH OpenFDO

Authors

Publication date 2 August 2001

zbMATH Keywords

almost-regulardegree sequencesextremal graphsLaplacian matrixnetwork reliabilitynumber of spanning treest-optimal graph

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Recommendations

• On the characterization of graphs with maximum number of spanning trees
• A new technique for the characterization of graphs with a maximum number of spanning trees
• Do nearly balanced multigraphs have more spanning trees?
• scientific article; zbMATH DE number 932184
• Maximizing spanning trees in almost complete graphs

Cited in

(4)

• On the characterization of graphs with maximum number of spanning trees
• Do nearly balanced multigraphs have more spanning trees?
• A generalization of Boesch's theorem
• Minimal graphs with a prescribed number of spanning trees

This page was built for publication:

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