The complexity of some families of cycle-related graphs
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-03-01
|
| Series: | Journal of Taibah University for Science |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1658365516300048 |
| Summary: | 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. |
|---|---|
| ISSN: | 1658-3655 |