Loading…
THE NUMBER OF SPANNING TREES IN SOME CLASSES OF GRAPHS
In this paper, using properties of Chebyshev polynomials, we give explicit formulas for the number of spanning trees in some classes of graphs, including join of graphs, Cartesian product of graphs and nearly regular graphs.
Saved in:
Published in: | The Rocky Mountain journal of mathematics 2012-01, Vol.42 (4), p.1183-1195 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, using properties of Chebyshev polynomials, we give explicit formulas for the number of spanning trees in some classes of graphs, including join of graphs, Cartesian product of graphs and nearly regular graphs. |
---|---|
ISSN: | 0035-7596 1945-3795 |
DOI: | 10.1216/RMJ-2012-42-4-1183 |