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

DOI10.1080/00207168908803749zbMath0674.05023OpenAlexW4233898078WikidataQ126244770 ScholiaQ126244770MaRDI QIDQ3828018

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/00207168908803749

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• A method in graph theory
• On the number of spanning trees of circulant graphs
• The number of spanning trees in a prism

Related Items (1)

The number of spanning trees of a graph with given matching number

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