Does the leading eigenvalue always increase with an edge addition to the graph? If so, how can I prove this?
Thank you
Does the leading eigenvalue always increase with an edge addition to the graph? If so, how can I prove this?
Thank you
Copyright © 2021 JogjaFile Inc.
It need not increase. Consider for example the graph $G$ formed by taking the disjoint union of a $k$-regular graph and two isolated vertices $x,y$.
The maximal eigenvalue of $G$ and $G+xy$ is clearly $k$.
If you're looking for ways to tackle this problem I suppose you should look at Weyl's inequalities.