Number of spanning trees in the sequence of some graphs

DOI10.1155/2019/4271783zbMath1420.05081OpenAlexW2922366535MaRDI QIDQ2325140

S. N. Daoud, Jia-Bao Liu

Publication date: 9 September 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/4271783

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (2)

Counting spanning trees of a type of generalized Farey graphs ⋮ Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic Laplacian-energy-like invariant of lattices
• Spanning trees on the Sierpinski gasket
• Complete characterization of bicyclic graphs with minimal Kirchhoff index
• Determinant identities for Laplace matrices
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• On the characterization of graphs with maximum number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• Complexity of graphs generated by wheel graph and their asymptotic limits
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• The complexity of some classes of pyramid graphs created from a gear graph
• A survey of some network reliability analysis and synthesis results
• Properties and applications of Laplacian spectra for Koch networks
• Enumeration of spanning trees on Apollonian networks
• Uniformly-most reliable networks do not always exist
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Asymptotic Enumeration of Spanning Trees

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