On the Complexity of Some Classes of Circulant Graphs and Chebyshev Polynomials

On the Complexity of Some Classes of Circulant Graphs and Chebyshev Polynomials

Deriving closed formulae of the number of spanning trees for various graphs has attracted the attention of a lot of researchers. In this paper we derive simple and explicit formulas for the number of spanning trees in many classes of circulant graphs using the properties of Chebyshev polynomials. De...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of mathematical combinatorics 2019-12, Vol.4, p.29-47
Hauptverfasser: Daoud, S N, Siddiqui, Muhammad Kamran
Format: Artikel
Sprache:eng
Schlagworte:
Chebyshev approximation
Complexity theory
Graph theory
Graphs
Numbers
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Deriving closed formulae of the number of spanning trees for various graphs has attracted the attention of a lot of researchers. In this paper we derive simple and explicit formulas for the number of spanning trees in many classes of circulant graphs using the properties of Chebyshev polynomials. Deriving closed formulae of the number of spanning trees for various graphs has attracted the attention of a lot of researchers. In this paper we derive simple and explicit formulas for the number of spanning trees in many classes of circulant graphs using the properties of Chebyshev polynomials.
ISSN:1937-1055
1937-1047