论文信息 - Complexity of some of Pyramid Graphs Created from a Gear Graph

Complexity of some of Pyramid Graphs Created from a Gear Graph

In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.

Jia-Bao Liu | S. N. Daoud

[1] Yuanping Zhang,et al. Chebyshev polynomials and spanning tree formulas for circulant and related graphs , 2005, Discret. Math..

[2] F. Y. Wu. Number of spanning trees on a lattice , 1977 .

[3] Guanrong Chen,et al. Properties and applications of Laplacian spectra for Koch networks , 2012 .

[4] Francis T. Boesch,et al. On unreliability polynomials and graph connectivity in reliable network synthesis , 1986, J. Graph Theory.

[5] H. Inaba,et al. Network reliability analysis by counting the number of spanning trees , 2004, IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004..

[6] H. Sachs,et al. A Theorem for Counting Spanning Trees in General Chemical Graphs and Its Particular Application to Toroidal Fullerenes , 2004 .

[7] Arnd Roth,et al. Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes , 1996, Discret. Appl. Math..

[8] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .

[9] Z. Fuji,et al. Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs , 1999 .

[10] Juliane Jung,et al. The Traveling Salesman Problem: A Computational Study , 2007 .

[11] Appajosyula Satyanarayana,et al. A survey of some network reliability analysis and synthesis results , 2009, Networks.