05C50 Online Seminar: Sukanta Pati

  • Date: 05/19/2023
  • Time: 08:00
Sukanta Pati, Indian Institute of Technology Guwahati (India)

University of Manitoba


Some observations on algebraic connectivity of graphs


Let G be a connected simple graph and L be its Laplacian matrix. Let v be a cut vertex and B be a branch at v. Assume that v_1 is the only vertex in B adjacent to v. Let P be a path that starts at v_1 and stays inside B. It is shown that the algebraic connectivity decreases if we do an appropriate sliding operation along the path. Similar results for trees were known decades ago. The techniques involve the notions of Perron branches and bottleneck matrices developed by Kirkland, Neumann, Shader and others.

Other Information: 

The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays.


Time: 8AM Pacific/10AM Central 


For more information, visit https://sites.google.com/view/05c50online/home


If you would like to attend, please register using this form to receive the zoom links: https://docs.google.com/forms/d/e/1FAIpQLSdQ98fh58cgeSWzbFe3t77i28FXDck1gYuX9jv_qd4kEf5l_Q/viewform?usp=sf_link