Published in

International Linear Algebra Society, Electronic Journal of Linear Algebra, (31), p. 740-753, 2016

DOI: 10.13001/1081-3810.3245

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 2016 by Slobodan Simić, Slobodan K. Simić, Zoran Stanic
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown
Data provided by SHERPA/RoMEO

Abstract

The polynomial reconstruction problem for simple graphs has been considered in the literature for more than forty years and is not yet resolved except for some special classes of graphs. Recently, the same problem has been put forward for signed graphs. Here, the reconstruction of the characteristic polynomial of signed graphs whose vertex-deleted subgraphs have least eigenvalue greater than $-2$ is considered.