Geodesic
The characterization of graphs with eigenvalue −1 of multiplicity n − 4 or n − 5
Filomat, Tome 33 (2019) no. 18, p. 5919

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

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
DOI : 10.2298/FIL1918919Y
Classification : 05C50
Keywords: Canonical graph, Primitive graph, Eigenvalue, Multiplicity 
Yuhong Yang; Qiongxiang Huang. The characterization of graphs with eigenvalue −1 of multiplicity n − 4 or n − 5. Filomat, Tome 33 (2019) no. 18, p. 5919 . doi: 10.2298/FIL1918919Y
@article{10_2298_FIL1918919Y,
     author = {Yuhong Yang and Qiongxiang Huang},
     title = {The characterization of graphs with eigenvalue \ensuremath{-}1 of multiplicity n \ensuremath{-} 4 or n \ensuremath{-} 5},
     journal = {Filomat},
     pages = {5919 },
     year = {2019},
     volume = {33},
     number = {18},
     doi = {10.2298/FIL1918919Y},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL1918919Y/}
}
TY  - JOUR
AU  - Yuhong Yang
AU  - Qiongxiang Huang
TI  - The characterization of graphs with eigenvalue −1 of multiplicity n − 4 or n − 5
JO  - Filomat
PY  - 2019
SP  - 5919 
VL  - 33
IS  - 18
UR  - http://geodesic.mathdoc.fr/articles/10.2298/FIL1918919Y/
DO  - 10.2298/FIL1918919Y
LA  - en
ID  - 10_2298_FIL1918919Y
ER  - 
%0 Journal Article
%A Yuhong Yang
%A Qiongxiang Huang
%T The characterization of graphs with eigenvalue −1 of multiplicity n − 4 or n − 5
%J Filomat
%D 2019
%P 5919 
%V 33
%N 18
%U http://geodesic.mathdoc.fr/articles/10.2298/FIL1918919Y/
%R 10.2298/FIL1918919Y
%G en
%F 10_2298_FIL1918919Y

Cité par Sources :