Polynomial reconstruction of signed graphs

DOI10.1016/j.laa.2016.03.036zbMath1334.05056OpenAlexW2339187589MaRDI QIDQ273155

Zoran Stanić, Slobodan K. Simic

Publication date: 21 April 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.036

zbMATH Keywords

eigenvaluescharacteristic polynomialsigned graphunicyclic graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (6)

Notes on the polynomial reconstruction of signed graphs ⋮ Perturbations in a signed graph and its index ⋮ Signed graphs with at most three eigenvalues ⋮ The polynomial reconstruction problem: the first 50 years ⋮ Spectra of quaternion unit gain graphs ⋮ Lower bounds for the least Laplacian eigenvalue of unbalanced blocks

Cites Work

• Combinatorial approach for computing the characteristic polynomial of a matrix
• Polynomial reconstruction and terminal vertices
• On the reconstruction of the characteristic polynomial of a graph
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
• The polynomial reconstruction of unicyclic graphs is unique
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial reconstruction of signed graphs