24 citations · 24 across the 2 of their papers we have counts for
5 papers
Most Laplacian eigenvalues of a tree are small
David P. Jacobs, Elismar R. Oliveira, Vilmar Trevisan
We show that the number of Laplacian eigenvalues greater than the average degree of a tree having vertices is at most .
Eigenvalue location in graphs of small clique-width
Martin Fürer, Carlos Hoppen, David P. Jacobs +1
Finding a diagonal matrix congruent to for constants , where is the adjacency matrix of a graph allows us to quickly tell the number of eigenvalues in a given i…
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…