The number of spanning trees of the generalized hypercube network

Authors:
C. S. Yang;L. C. Han
Affiliations:
Institute of Information Engineering National Sun Yat-sen University, Kaohsiung, Taiwan, R.O.C.;Chung-Yu Junior College Business Administration Keelung, Taiwan, R.O.C.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1993

Citing 5
Cited 0

Distributed fault-tolerance for large multiprocessor systems

ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
A large scale, homogeneous, fully distributed parallel machine, I

ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Communication Structures for Large Networks of Microcomputers

IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array

IEEE Transactions on Computers
Fault Diagnosis in a Boolean n Cube Array of Microprocessors

IEEE Transactions on Computers

Quantified Score

Hi-index	0.98

Visualization

Abstract

The relationship between the number of spanning trees of graphs and network reliability is well-known. In this paper, the generalized hypercube networks are presented, based on a mixed radix number system. And then we will derive a simple formula for the number of spanning trees of these networks.