Sign in
Back
The complexity of some families of cycle-related graphs
Journal article   Peer reviewed

The complexity of some families of cycle-related graphs

S.N. Daoud and K. Mohamed
Journal of Taibah University for Science, Vol.11(2), pp.205-228
01/03/2017
DOI: https://doi.org/10.1016/j.jtusci.2016.04.002

Abstract

Chebyshev polynomials Flower graph Gear graphs Spanning trees Sphere graph Sun graph
In this paper, we derive new formulas for the number of spanning trees of a specific family of graphs – gear graphs, flower graphs, sun graphs and sphere graphs – using techniques from linear algebra, Chebyshev polynomials and matrix theory.

Metrics

1 Record Views

Details