Abstract
Using the composition of some existing smaller graphs to construct some large graphs, the number of spanning trees and the Laplacian eigenvalues of such large graphs are also closely related to those of the corresponding smaller ones. By using tools from linear algebra and matrix theory, we establish closed formulae for the number of spanning trees of the composition of two graphs with one of them being an arbitrary complete 3-partite graph and the other being an arbitrary graph. Our results extend some of the previous work, which depend on the structural parameters such as the number of vertices and eigenvalues of the small graphs only.
| Original language | English |
|---|---|
| Article number | 613685 |
| Journal | Mathematical Problems in Engineering |
| Volume | 2014 |
| DOIs | |
| State | Published - 2014 |
| Externally published | Yes |