Suil O (오수일), The second largest eigenvalue and vertex-connectivity in regular graphs

The second largest eigenvalue and vertex-connectivity in regular graphs
Suil O (오수일)
Department of Applied Mathematics & Statistics, SUNY Korea, Incheon
2017/2/3 Fri 4PM-5PM
In this talk, for a fixed positive integer d at least 3, we study upper
bounds for the second largest eigenvalue in (an n-vertex) d-regular graph to
guarantee a certain vertex-connectivity.

Tags:

This entry was posted on Monday, January 23rd, 2017 at 1:31 pm and is filed under 2017, KAIST Discrete Math Seminar. You can follow any responses to this entry through the RSS 2.0 feed. Both comments and pings are currently closed.

Comments are closed.