Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2

DOI10.13001/1081-3810.3245zbMath1352.05119OpenAlexW2560240230MaRDI QIDQ2953120

Zoran Stanić, Slobodan K. Simic

Publication date: 3 January 2017

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13001/1081-3810.3245

zbMATH Keywords

eigenvaluescharacteristic polynomialnumerical computationsigned graphsigned line graphexceptional graph

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Notes on the polynomial reconstruction of signed graphs ⋮ Connected signed graphs of fixed order, size, and number of negative edges with maximal index ⋮ The polynomial reconstruction problem: the first 50 years ⋮ Spectra of signed graphs with two eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signed line graphs with least eigenvalue -2: the star complement technique
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• Graphs with least eigenvalue \(-2\): ten years on
• Polynomial reconstruction and terminal vertices
• On the reconstruction of the characteristic polynomial of a graph
• On the Laplacian coefficients of signed graphs
• Practical graph isomorphism. II.
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)

This page was built for publication: Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2