The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 | Zendy

Yuhong Yang | Zendy; Qiongxiang Huang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

Author(s) -

Yuhong Yang,

Qiongxiang Huang

Publication year - 2019

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil1918919y

Subject(s) - multiplicity (mathematics) , mathematics , eigenvalues and eigenvectors , combinatorics , indifference graph , chordal graph , discrete mathematics , graph , mathematical analysis , physics , quantum mechanics

Petrović in [M. Petrović, On graphs with exactly one eigenvalue less than −1, J. Combin. Theory Ser. B 52 (1991) 102–112] determined all connected graphs with exactly one eigenvalue less than −1 and all minimal graphs with exactly two eigenvalues less than −1. By using these minimal graphs, in this paper, we determine all connected graphs having −1 as an eigenvalue with multiplicity n − 4 or n − 5.

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