24 citations · 140 across the 20 of their papers we have counts for
4 papers · 1 filter
Laplacian Distribution and Domination
Domingos M. Cardoso, David P. Jacobs, Vilmar Trevisan
Let denote the number of Laplacian eigenvalues of a graph in an interval , and let denote its domination number. We extend the recent result $m_G[0,1) \leq γ…
Eigenvalue location in cographs
David P. Jacobs, Vilmar Trevisan, Fernando C. Tura
We give an time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and . Applications in…
On a conjecture involving Laplacian eigenvalues of trees
David P. Jacobs, Vilmar Trevisan
Motivated by classic tree algorithms, in 1995 we designed a bottom-up algorithm to compute the determinant of a tree's adjacency matrix . In 2010 an algorithm was…
Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy
Christoph Helmberg, Vilmar Trevisan
The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over…