most citedUpper bound for the Laplacian eigenvalues of a graph

3 citations · 5 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2015★ 2 cited

Arrangements of equal minors in the positive Grassmannian

Miriam Farber, Alexander Postnikov

We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate the structure of equalities and inequalities between the minors. We show that a…

math.CO2011★ 3 cited

Upper bound for the Laplacian eigenvalues of a graph

Miriam Farber, Ido Kaminer

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let be a simple graph on vertices. Let and be the -t…