The number of spanning trees of the generalized Boolean n-cube network

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

doi:10.1016/0898-1221(88)90007-7

The number of spanning trees of the generalized Boolean n-cube network

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

Institute of Computer and Communication Engineering

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

4 Citations (Scopus)

Abstract

In this paper, the well-known Boolean n-cube networks are extended to the generalized Boolean n-cube networks which are based on a mixed radix number system. Although a classic theorem-the matrix tree theorem-can compute the number of spanning trees of any graph, however, we derive a simple formula for this general structure.

Original language	English
Pages (from-to)	715-725
Number of pages	11
Journal	Computers and Mathematics with Applications
Volume	16
Issue number	9
DOIs	https://doi.org/10.1016/0898-1221(88)90007-7
Publication status	Published - 1988

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1016/0898-1221(88)90007-7

Cite this

@article{c3518007f1114abaa37798d509c2c6ae,

title = "The number of spanning trees of the generalized Boolean n-cube network",

abstract = "In this paper, the well-known Boolean n-cube networks are extended to the generalized Boolean n-cube networks which are based on a mixed radix number system. Although a classic theorem-the matrix tree theorem-can compute the number of spanning trees of any graph, however, we derive a simple formula for this general structure.",

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

year = "1988",

doi = "10.1016/0898-1221(88)90007-7",

language = "English",

volume = "16",

pages = "715--725",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Limited",

number = "9",

}

TY - JOUR

T1 - The number of spanning trees of the generalized Boolean n-cube network

AU - Huang, T. C.

AU - Wang, J. F.

AU - Yang, C. S.

AU - Lee, J. Y.

PY - 1988

Y1 - 1988

N2 - In this paper, the well-known Boolean n-cube networks are extended to the generalized Boolean n-cube networks which are based on a mixed radix number system. Although a classic theorem-the matrix tree theorem-can compute the number of spanning trees of any graph, however, we derive a simple formula for this general structure.

AB - In this paper, the well-known Boolean n-cube networks are extended to the generalized Boolean n-cube networks which are based on a mixed radix number system. Although a classic theorem-the matrix tree theorem-can compute the number of spanning trees of any graph, however, we derive a simple formula for this general structure.

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

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

U2 - 10.1016/0898-1221(88)90007-7

DO - 10.1016/0898-1221(88)90007-7

M3 - Article

AN - SCOPUS:45549120398

SN - 0898-1221

VL - 16

SP - 715

EP - 725

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 9

ER -

The number of spanning trees of the generalized Boolean n-cube network

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this