The Number of Spanning Trees of the Regular Networks

C. S. Yang; J. F. Wang; J. Y. Lee; F. T. Boesch

doi:10.1080/00207168808803618

The Number of Spanning Trees of the Regular Networks

C. S. Yang, J. F. Wang, J. Y. Lee, F. T. Boesch

MS Degree in AI Robotics

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

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.

Original language	English
Pages (from-to)	185-200
Number of pages	16
Journal	International Journal of Computer Mathematics
Volume	23
Issue number	3-4
DOIs	https://doi.org/10.1080/00207168808803618
Publication status	Published - 1988 Jan

All Science Journal Classification (ASJC) codes

Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1080/00207168808803618

Cite this

@article{6491cce8759845c788692f11d3985769,

title = "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.",

author = "Yang, {C. S.} and Wang, {J. F.} and Lee, {J. Y.} and Boesch, {F. T.}",

year = "1988",

month = jan,

doi = "10.1080/00207168808803618",

language = "English",

volume = "23",

pages = "185--200",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3-4",

}

TY - JOUR

T1 - The Number of Spanning Trees of the Regular Networks

AU - Yang, C. S.

AU - Wang, J. F.

AU - Lee, J. Y.

AU - Boesch, F. T.

PY - 1988/1

Y1 - 1988/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0040389840&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040389840&partnerID=8YFLogxK

U2 - 10.1080/00207168808803618

DO - 10.1080/00207168808803618

M3 - Article

AN - SCOPUS:0040389840

SN - 0020-7160

VL - 23

SP - 185

EP - 200

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 3-4

ER -

The Number of Spanning Trees of the Regular Networks

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this