An alternate proof of the formula for the characteristic polynomial of a threshold graph

MaRDI QIDQ5251973zbMATHFDO

Authors Monika Heinig, John T. Saccoman, Charles L. Suffel, Daniel J. Gross

Publication date 21 May 2015

zbMATH Keywords

spanning treesLaplaciancharacteristic polynomialmatrix-tree theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Graph polynomials (05C31) Vertex degrees (05C07)

Recommendations

• Laplacian spectra and spanning trees of threshold graphs
• Computing the characteristic polynomial of threshold graphs
• Spanning tree enumeration and nearly triangular graph Laplacians
• Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs
• Linear algebraic techniques for spanning tree enumeration

Cited in

(1)

• Spanning tree enumeration and nearly triangular graph Laplacians

This page was built for publication: An alternate proof of the formula for the characteristic polynomial of a threshold graph

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