|
| << previous |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 10 of 10 found articles
| Title: |
The number of spanning trees of the regular networks |
| Author: |
Yang, C. S. Wang, J. F. Lee, J. Y. Boesch, F. T. |
| Appeared in: |
International journal of computer mathematics |
| Paging: | Volume 23 (1988) nr. 3-4 pages 185-200 |
| Year: |
1988 |
| Contents: |
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. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 10 of 10 found articles
| << previous |