Number of spanning trees in the sequence of some graphs

DOI10.1155/2019/4271783MaRDI QIDQ2325140zbMATH OpenOpenAlexFDO

Authors Jiabao Liu, S. N. Daoud

Publication date 9 September 2019

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Review text

Summary: In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs. In this work, using knowledge of difference equations, we drive the explicit formulas for the number of spanning trees in the sequence of some graphs generated by a triangle by electrically equivalent transformations and rules of weighted generating function. Finally, we compare the entropy of our graphs with other studied graphs with average degree being 4, 5, and 6.

Recommendations

• Enumeration of spanning trees in the sequence of Dürer graphs
• The number of spanning trees in self-similar graphs
• Number of spanning trees in the sequence of some nonahedral graphs
• Counting spanning trees in prism and anti-prism graphs
• Number of spanning trees of different products of complete and complete bipartite graphs

Cites work

• A certain polynomial of a graph and graphs with an extremal number of trees
• A survey of some network reliability analysis and synthesis results
• Asymptotic Enumeration of Spanning Trees
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• Asymptotic Laplacian-energy-like invariant of lattices
• Complete characterization of bicyclic graphs with minimal Kirchhoff index
• Complexity of graphs generated by wheel graph and their asymptotic limits
• Counting spanning trees in prism and anti-prism graphs
• Determinant identities for Laplace matrices
• Enumeration of spanning trees on Apollonian networks
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Number of spanning trees in different products of complete and complete tripartite graphs.
• On the characterization of graphs with maximum number of spanning trees
• Properties and applications of Laplacian spectra for Koch networks
• Spanning trees on the Sierpinski gasket
• The complexity of some classes of pyramid graphs created from a gear graph
• The traveling salesman problem. A computational study.
• Uniformly-most reliable networks do not always exist

Cited in

(9)

• Enumeration of spanning trees in the sequence of Dürer graphs
• The number of spanning trees of a family of 2-separable weighted graphs
• Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks
• Counting spanning trees of a type of generalized Farey graphs
• Number of spanning trees in the sequence of some nonahedral graphs
• Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof
• scientific article; zbMATH DE number 5584928 (Why is no real title available?)
• scientific article; zbMATH DE number 5497806 (Why is no real title available?)
• Sequences of spanning trees and a fixed tree theorem

Describes a project that uses

Uses Software

• Concorde

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

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