The number of spanning trees of the generalized Boolean \(n\)-cube network (Q1113880)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of spanning trees of the generalized Boolean \(n\)-cube network |
scientific article; zbMATH DE number 4081474
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of spanning trees of the generalized Boolean \(n\)-cube network |
scientific article; zbMATH DE number 4081474 |
Statements
The number of spanning trees of the generalized Boolean \(n\)-cube network (English)
0 references
1988
0 references
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.
0 references
Boolean \(n\)-cube networks
0 references
mixed radix number system
0 references
matrix tree theorem
0 references
spanning trees
0 references
0 references
