The number of spanning trees of the Cartesian product of regular graphs (Q1719076)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of spanning trees of the Cartesian product of regular graphs |
scientific article |
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
