The number of spanning trees of the Cartesian product of regular graphs (Q1719076)
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: The number of spanning trees of the Cartesian product of regular graphs |
scientific article; zbMATH DE number 7017189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of spanning trees of the Cartesian product of regular graphs |
scientific article; zbMATH DE number 7017189 |
Statements
The number of spanning trees of the Cartesian product of regular graphs (English)
0 references
8 February 2019
0 references
Summary: The number of spanning trees in graphs or in networks is an important issue. The evaluation of this number not only is interesting from a mathematical (computational) perspective but also is an important measure of reliability of a network or designing electrical circuits. In this paper, a simple formula for the number of spanning trees of the Cartesian product of two regular graphs is investigated. Using this formula, the number of spanning trees of the four well-known regular networks can be simply taken into evaluation.
0 references
0 references
0.9353915
0 references
0.93365866
0 references
0 references
0.9226265
0 references
0.9141768
0 references
0.9131224
0 references
0.9126539
0 references
