Connected graphs with a minimal number of spanning trees

DOI10.1016/0095-8956(81)90061-7zbMath0403.05029OpenAlexW2084609044MaRDI QIDQ1255959

Norbert Gaffke

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90061-7

zbMATH Keywords

Connected GraphsMatrix Associated with a GraphMinimal Number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

D-optimal block designs with at most six varieties ⋮ Optimal incomplete-block designs with low replication: a unified approach using graphs

Cites Work

• A certain polynomial of a graph and graphs with an extremal number of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connected graphs with a minimal number of spanning trees