The complexity of some classes of pyramid graphs created from a gear graph

DOI10.3390/SYM10120689MaRDI QIDQ2337852zbMATH OpenOpenAlexFDO

Authors Jiabao Liu, S. N. Daoud

Publication date 20 November 2019

Published in Symmetry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/sym10120689

zbMATH Keywords

Chebyshev polynomialscomplexitygear graphpyramid graphs

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

Summary: The methods of measuring the complexity (spanning trees) in a finite graph, a problem related to various areas of mathematics and physics, have been inspected by many mathematicians and physicists. In this work, we defined some classes of pyramid graphs created by a gear graph then we developed the Kirchhoff's matrix tree theorem method to produce explicit formulas for the complexity of these graphs, using linear algebra, matrix analysis techniques, and employing knowledge of Chebyshev polynomials. Finally, we gave some numerical results for the number of spanning trees of the studied graphs.

Recommendations

• On the complexity of a class of pyramid graphs and Chebyshev polynomials
• Chebyshev polynomials and spanning tree formulas
• Complexity of graphs generated by wheel graph and their asymptotic limits
• Complexity of products of some complete and complete bipartite graphs
• Enumeration of spanning trees in prisms of some 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
• Algebraic Graph Theory
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• Chebyshev polynomials and spanning tree formulas
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Complexity of graphs generated by wheel graph and their asymptotic limits
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3204642 (Why is no real title available?)
• Number of spanning trees in different products of complete and complete tripartite graphs.
• On incidence energy
• On the complexity of a class of pyramid graphs and Chebyshev polynomials
• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Properties and applications of Laplacian spectra for Koch networks
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• The traveling salesman problem. A computational study.

Cited in

(4)

• Small \(k\)-pyramids and the complexity of determining \(k\)
• Number of spanning trees in the sequence of some graphs
• On the complexity of a class of pyramid graphs and Chebyshev polynomials
• Enumeration of spanning trees in prisms of some graphs

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: The complexity of some classes of pyramid graphs created from a gear graph

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