Maximizing the number of spanning trees of networks based on cycle basis representation

DOI10.1080/00207168908803727zbMath0682.05037OpenAlexW2139766564MaRDI QIDQ4731203

No author found.

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803727

zbMATH Keywords

graphsinteger programcycle basisspanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items (2)

Uniformly optimally reliable graphs: A survey ⋮ The maximum number of spanning trees of a graph with given matching number

Cites Work

• Unnamed Item
• On the number of spanning trees of circulant graphs
• The number of spanning trees in a prism

This page was built for publication: Maximizing the number of spanning trees of networks based on cycle basis representation