Abstract
In this paper, some formulae for computing the numbers of spanning trees of the corona and the join of graphs are deduced.
Original language | English |
---|---|
Pages (from-to) | 45-52 |
Number of pages | 8 |
Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
Volume | 89 |
Publication status | Published - May 2014 |
Scopus Subject Areas
- Mathematics(all)
User-Defined Keywords
- Laplacian spectrum
- Matrix-tree theorem
- Spanning trees