scientific article; zbMATH DE number 1161299

zbMATH Open0954.05028MaRDI QIDQ4393293FDOQ4393293

Authors: Nora Hartsfield, Yun-Qiu Shen, Alexander Kelmans 

Publication date: 8 June 1998

Title of this publication is not available (Why is that?)

Recommendations

• A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
• On the spanning trees of the hypercube and other products of graphs
• scientific article; zbMATH DE number 1926055
• Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs
• Cellular spanning trees and laplacians of cubical complexes

zbMATH Keywords

spanning treesCartesian productmatrix-tree theoremLaplacian polynomials

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Cited In (4)

• A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
• Cellular spanning trees and laplacians of cubical complexes
• Weighted complexities of graph products and bundles
• On the distribution of eigenvalues of graphs

This page was built for publication:

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