The number of spanning trees of the generalized hypercube network

DOI10.1016/0895-7177(93)90200-IzbMATH Open0787.05068OpenAlexW2062592571MaRDI QIDQ1802487FDOQ1802487

Authors: Yanyan Li 

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

spanning treesKirchhoff matrixgeneralized hypercube network

Mathematics Subject Classification ID

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

Cites Work

• Graph theoretic reliability analysis for the Boolean n cube networks
• Parallel concepts in graph theory
• Title not available (Why is that?)
• The Indirect Binary n-Cube Microprocessor Array
• On the number of spanning trees of circulant graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• Title not available (Why is that?)
• 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 hypercube network

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