Maximizing the number of spanning trees on the (p,p+2) graphs

DOI10.1080/00207169008803812MaRDI QIDQ4009724zbMATH OpenOpenAlexFDO

Authors Mei Hwei Wu

Publication date 27 September 1992

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Principles of combinatorics
• Properties of the distance matrix of a tree
• Reliable circuits using less reliable relays
• Spanning tree formulas and Chebyshev polynomials

Cited in

(4)

• The maximum number of spanning trees of a graph with given matching number
• The number of spanning trees of a graph with given matching number
• 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: Maximizing the number of spanning trees on the (p,p+2) graphs

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