The number of spanning trees of the generalized hypercube network

DOI10.1016/0895-7177(93)90200-IMaRDI QIDQ1802487zbMATH OpenOpenAlexFDO

Authors Yanyan Li, Chu-Sing Yang, L. C. Han

Publication date 21 July 1993

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(93)90200-i

zbMATH Keywords

generalized hypercube networkKirchhoff matrixspanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

The authors use the Kirchhoff matrix for the generalized hypercube network \(\text{GH}(r,n)\) to establish a relatively simple formula for the number of spanning trees of \(\text{GH}(r,n)\).

Cites work

• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• Graph theoretic reliability analysis for the Boolean n cube networks
• scientific article; zbMATH DE number 3781344 (Why is no real title available?)
• scientific article; zbMATH DE number 3260415 (Why is no real title available?)
• scientific article; zbMATH DE number 3339178 (Why is no real title available?)
• scientific article; zbMATH DE number 3390818 (Why is no real title available?)
• On the number of spanning trees of circulant graphs
• Parallel concepts in graph theory
• The identification of an incompletely partitioned network
• The Indirect Binary n-Cube Microprocessor Array
• The number of spanning trees of the regular networks

This page was built for publication: The number of spanning trees of the generalized hypercube network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802487)