24 citations · 35 across the 12 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
On I-eigenvalue free threshold graphs
Luiz Emilio Allem, Elismar R. Oliveira, Fernando Tura
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 two algorithms for generating I-…
math.CO2021
Laplacian eigenvalues of equivalent cographs
J. Lazzarin, O. F. Márquez, F. C. Tura
Let G and H be equivalent cographs with their reduction R_G and R_H, and suppose the vertices of R_G and R_H are labeled by the twin numbers t_i of the k twin classes they represen…