Computing the determinant of a signed graph

DOI10.1515/MATH-2023-0188MaRDI QIDQ6595250zbMATH OpenFDO

Authors Bader Alshamary, Zoran Stanić

Publication date 30 August 2024

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/MATH-2023-0188

zbMATH Keywords

bicyclic graphchain graphcharacteristic polynomialdeterminanteigenvaluessigned graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• A note on a walk-based inequality for the index of a signed graph
• A note on the eigenvalue free intervals of some classes of signed threshold graphs
• An introduction to the theory of graph spectra
• Combinatorial approach for computing the characteristic polynomial of a matrix
• Further results on the nullity of signed graphs
• Matrices in the theory of signed simple graphs
• More on signed graphs with at most three eigenvalues
• On the eigenvalues of some tridiagonal matrices
• On the Laplacian coefficients of signed graphs
• The polynomial reconstruction of unicyclic graphs is unique
• The polynomial reconstruction problem: the first 50 years
• Walks and eigenvalues of signed graphs

This page was built for publication: Computing the determinant of a signed graph

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