1 citations · 2 across the 6 of their papers we have counts for
15 papers
The minimum number of distinct eigenvalues of a threshold graph is at most
Luiz Emilio Allem, Carlos Hoppen, João Lazzarin +2
In this note we show that the minimum number of distinct eigenvalues of a threshold graph is at most . Moreover, given any threshold graph and any nonzero real number , w…
A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
Guantao Chen, Fernando C. Tura
In this paper, we give a linear algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need to directly compute the eigenval…
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-…
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…
A conjecture of eigenvalues of threshold graphs
Fernando Tura
Let be the anti-regular graph of order It was conjectured that among all threshold graphs on vertices, has the smallest positive eigenvalue and the largest eig…
On the eccentricity energy of complete mutipartite graph
Fernando Tura
The eccentricity (anti-adjacency) matrix of a graph is obtained from the distance matrix by retaining the eccentricities in each row and each column. The $\var…