Geodesic
Generating \(I\)-eigenvalue free threshold graphs
The electronic journal of combinatorics, Tome 30 (2023) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A graph is said to be $I$-eigenvalue free if it has no eigenvalues in the interval $I$ with respect to the adjacency matrix $A$. In this paper we present twoalgorithms for generating $I$-eigenvalue free threshold graphs.
DOI : 10.37236/11225
Classification : 05C50, 05C75, 05C85
Mots-clés : cotrees, inertia of a graph

Luiz Emilio Allem  1   ; Elismar R. Oliveira  1   ; Fernando Tura  2

1 UFRGS
2 UFSM 
@article{10_37236_11225,
     author = {Luiz Emilio Allem and Elismar R. Oliveira and Fernando Tura},
     title = {Generating {\(I\)-eigenvalue} free threshold graphs},
     journal = {The electronic journal of combinatorics},
     year = {2023},
     volume = {30},
     number = {2},
     doi = {10.37236/11225},
     zbl = {1516.05116},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/11225/}
}
TY  - JOUR
AU  - Luiz Emilio Allem
AU  - Elismar R. Oliveira
AU  - Fernando Tura
TI  - Generating \(I\)-eigenvalue free threshold graphs
JO  - The electronic journal of combinatorics
PY  - 2023
VL  - 30
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/11225/
DO  - 10.37236/11225
ID  - 10_37236_11225
ER  - 
%0 Journal Article
%A Luiz Emilio Allem
%A Elismar R. Oliveira
%A Fernando Tura
%T Generating \(I\)-eigenvalue free threshold graphs
%J The electronic journal of combinatorics
%D 2023
%V 30
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/11225/
%R 10.37236/11225
%F 10_37236_11225
Luiz Emilio Allem; Elismar R. Oliveira; Fernando Tura. Generating \(I\)-eigenvalue free threshold graphs. The electronic journal of combinatorics, Tome 30 (2023) no. 2. doi: 10.37236/11225

Cité par Sources :