Miriam Farber

activity

20112016

most citedWeak Separation, Pure Domains and Cluster Distance

5 citations · 14 across the 9 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

math.CO2011

Nonpositive Eigenvalues of the Adjacency Matrix and Lower Bounds for Laplacian Eigenvalues

Zachary B. Charles, Miriam Farber, Charles R. Johnson +1

Let $N P O (k)$ be the smallest number $n$ such that the adjacency matrix of any undirected graph with $n$ vertices or more has at least $k$ nonpositive eigenvalues. We show that $NPO…

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 $G$ be a simple graph on $n$ vertices. Let $d_{m} (G)$ and $λ_{m + 1} (G)$ be the $m$ -t…