The number of spanning trees of the generalized Boolean \(n\)-cube network (Q1113880): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0898-1221(88)90007-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026560102 / rank | |||
Normal rank | |||
Revision as of 02:29, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of spanning trees of the generalized Boolean \(n\)-cube network |
scientific article |
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
