Number of spanning trees in the sequence of some nonahedral graphs

zbMATH Open1464.05190MaRDI QIDQ4989587FDOQ4989587

Authors: S. N. Daoud 

Publication date: 25 May 2021

Recommendations

• Number of spanning trees in the sequence of some graphs
• Enumeration of spanning trees in the sequence of Dürer graphs
• Counting spanning trees in prism and anti-prism graphs
• A formula for the number of spanning trees in circulant graphs with nonfixed generators and discrete tori
• The number of spanning trees in some classes of graphs

zbMATH Keywords

spanning treeselectrically equivalent transformationsFritsch graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Infinite graphs (05C63)

Cited In (3)

• The non-\(\ell\)-part of the number of spanning trees in abelian \(\ell\)-towers of multigraphs
• Number of spanning trees in the sequence of some graphs
• Sequences of spanning trees and a fixed tree theorem

This page was built for publication: Number of spanning trees in the sequence of some nonahedral graphs

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