4 papers · 1 filter
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…
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…
An explicit formula for the distance characteristic polynomial of threshold graphs
Joao Lazzarin, Oscar F. Marquez, Fernando C. Tura
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the distance characteristic polynomial of a…
No Threshold graphs are cospectral
J. Lazzarin, O. F. Márquez, F. Tura
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the characteristic polynomial of a threshold…