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

DOI10.1016/0898-1221(88)90007-7zbMath0661.94026OpenAlexW2026560102MaRDI QIDQ1113880

S. H. Smith

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90007-7

zbMATH Keywords

spanning treesmatrix tree theoremBoolean \(n\)-cube networksmixed radix number system

Mathematics Subject Classification ID

Related Items (1)

The number of spanning trees of the Cartesian product of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theoretic characterization and reliability of the generalized Boolean n-cube network
• Parallel concepts in graph theory
• On the number of spanning trees of circulant graphs
• Graph theoretic reliability analysis for the Boolean n cube networks
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• The Indirect Binary n-Cube Microprocessor Array
• The number of spanning trees of the regular networks
• The identification of an incompletely partitioned network

This page was built for publication: The number of spanning trees of the generalized Boolean \(n\)-cube network