A method to calculate the characteristic polynomials of a graph on n vertices by the aid of a computer

MaRDI QIDQ2858617zbMATH OpenFDO

Authors Muhuo Liu, Bolian Liu

Publication date 19 November 2013

Published in Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixcharacteristic polynomialLaplacian matrixsignless Laplacian matrix

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5671368
• scientific article; zbMATH DE number 9717
• Computing the characteristic polynomial of threshold graphs
• On the \(A_{\alpha}\)-characteristic polynomial of a graph
• scientific article; zbMATH DE number 4041160
• Efficient computation of the characteristic polynomial of a threshold graph
• Efficient computation of the characteristic polynomial of a threshold graph
• Evaluation of the characteristic polynomial of a graph
• Characteristic Polynomial Analysis on Matrix Representations of Graphs
• A combinatorial method for computing characteristic polynomials of starlike hypergraphs

Cited in

(2)

• Some results on the signless Laplacian spectra of unicyclic graphs
• A new method to compute the determinantal polynomial coefficients of a matrix (symmetric normalized Kirchhoff matrix) of a complete graph

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: A method to calculate the characteristic polynomials of a graph on \(n\) vertices by the aid of a computer

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