24 citations · 140 across the 20 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
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…
math.CO2017
Partial characterization of graphs having a single large Laplacian eigenvalue
L. Emilio Allem, Antonio Cafure, Ezequiel Dratman +3
The parameter of a graph stands for the number of Laplacian eigenvalues greater than or equal to the average degree of . In this work, we address the problem of chara…
math.CO2017★ 17 cited
No two starlikes have equal index
Elismar R. Oliveira, Dragan Stevanović, Vilmar Trevisan
The index of a graph is the largest eigenvalue of its adjacency matrix. A starlike is a tree having a unique vertex of degree . We show how to order the starlike trees with $n…