JISE

[1] [2] [3] [4] [5] [6] [7] [8]

Journal of Information Science and Engineering, Vol. 7 No. 1, pp. 25-35

The Number of Spanning Trees of Regular Graphs

Mei Hwai Wu, Jhing-Fa Wang⁺ and Chu-Sing Yang^#
Computer Center
Chia-Nan Junior College of Pharmacy
Tainan, Taiwan, 71710, R.O.C.
⁺Institute of Electrical and Computer Engineering,
National Cheng Kung University
Tainan, Taiwan, R.O.C.
^# Institute of Electrical and Computer Engineering,
National Sun Yat-Sen University
Kaoshung, Taiwan, R.O.C.

Using the Matrix-Tree Theorem, a simple formula for the number of spanning trees of a special class of graphs known as regular graphs is obtained in this paper.

Keywords: Spanning tree, regular graph

Retrieve PDF document (JISE_199101_03.pdf)