24 citations · 35 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
More on Equienergetic Threshold Graphs
Fernando Tura
The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A threshold graph G on n vertices is coded by a binary sequence of lengt…
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…
Multiplicity of eigenvalues of cographs
Luiz Emilio Allem, Fernando Tura
Motivated by the linear time algorithm that locates the eigenvalues of a cograph G [10], we investigate the multiplicity of eigenvalue for λ\neq -1,0. For cographs with balanced co…