|
|||||
|
|
The number of spanning trees of the regular networks |
|
| Abstract: | The classic theorem on graphs and matrices is the Matrix-Tree Theorem, which gives the number of spanning trees t(G) of any graph G as the value of a certain determinant. However, in this paper, we will derive a simple formula for the number of spanning trees of the regular networks. |
| Keywords: | Regular network spanning tree Boolean n-cube network |