28 citations · 54 across the 20 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
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
A - and sparsest basis for the null space of a forest in optimal time
Daniel A. Jaume, Gonzalo Molina, Adrián Pastine +1
Given a matrix, the Null Space Problem asks for a basis of its null space having the fewest nonzeros. This problem is known to be NP-complete and even hard to approximate. The null…