Number of spanning trees of different products of complete and complete bipartite graphs (Q1719484)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Number of spanning trees of different products of complete and complete bipartite graphs |
scientific article; zbMATH DE number 7017730
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Number of spanning trees of different products of complete and complete bipartite graphs |
scientific article; zbMATH DE number 7017730 |
Statements
Number of spanning trees of different products of complete and complete bipartite graphs (English)
0 references
8 February 2019
0 references
Summary: Spanning trees have been found to be structures of paramount importance in both theoretical and practical problems. In this paper we derive new formulas for the complexity, number of spanning trees, of some products of complete and complete bipartite graphs such as Cartesian product, normal product, composition product, tensor product, symmetric product, and strong sum, using linear algebra and matrix theory techniques.
0 references
0 references
0 references
0.9358288
0 references
0.9226265
0 references
0.9199959
0 references
0.9095185
0 references
0.9084157
0 references
