Graphs with all but two eigenvalues in [-2,0] | Zendy

Nair Maria Maia de Abreu | Zendy; Jorge Alencar | Zendy; André Ebling Brondani | Zendy; Leonardo de Lima | Zendy; Carla Silva Oliveira | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Graphs with all but two eigenvalues in [-2,0]

Author(s) -

Nair Maria Maia de Abreu,

Jorge Alencar,

André Ebling Brondani,

Leonardo de Lima,

Carla Silva Oliveira

Publication year - 2020

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.2286

Subject(s) - mathematics , eigenvalues and eigenvectors , adjacency matrix , combinatorics , spectrum of a matrix , indifference graph , matrix differential equation , spectrum (functional analysis) , graph , discrete mathematics , mathematical analysis , physics , quantum mechanics , differential equation

The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette characterized all graphs with all but two eigenvalues equal to −2 and 0. In this article, we extend their result by characterizing explicitly all graphs with all but two eigenvalues in the interval [−2, 0]. Also, we determine among them those that are determined by their spectrum.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research