The Number of Spanning Trees of the Cartesian Product of Regular Graphs

الملخص EN

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.