Notation: $\lambda_{\max}(G)$ is the largest eigenvalue of the Laplacian matrix of the graph $G$ (aka the Laplacian index of $G$).

Now suppose $G$ is a Hamiltonian graph with Hamiltonian cycle $C$.

Is there a non-trivial lower bound on $\lambda_{\max}(G)-\lambda_{\max}(G-C)$?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.