Let $G$ be any graph with at least one edge and let $e$ be any edge of $G$. Let $Ge$ denote the subgraph of $G$ obtained by deletion of the edge $e$. Assume that $G$ has $n$ vertices. Suppose that $\lambda_1(G)\geq\cdots\geq \lambda_n(G)$ and $\lambda_1(Ge)\geq\cdots\geq \lambda_n(Ge)$ are eigenvalues of $G$ and $Ge$, respectively. It is true that $\lambda_i(G)\cdot\lambda_i(Ge)\geq 0$ for all $i=1,\dots,n$?
Take the 2minute tour
×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
I think this is false and there are counterexamples. Here is a sage session.


