The complexity of some classes of pyramid graphs created from a gear graph (Q2337852)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7133830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of some classes of pyramid graphs created from a gear graph |
scientific article; zbMATH DE number 7133830 |
Statements
The complexity of some classes of pyramid graphs created from a gear graph (English)
0 references
20 November 2019
0 references
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.
0 references
complexity
0 references
Chebyshev polynomials
0 references
gear graph
0 references
pyramid graphs
0 references
0 references
0 references
0 references
0.8426846265792847
0 references
0.7210615873336792
0 references
0.7191879749298096
0 references
0.719086766242981
0 references
0.7167627215385437
0 references
