05C50 Online Seminar: Lord Kavi
Topic
Towards Haemers Laplacian Toughness Conjecture
Speakers
Details
Graph toughness, introduced by Chvátal in 1973, is a key measure of how well different parts of a graph are connected, with implications for Hamiltonicity, spanning trees, connectivity, and more. We derive new bounds on graph toughness and confirm specific cases of a Laplacian-based toughness conjecture by Haemers. Our results include confirmations for regular bipartite graphs, trees, graphs with at least one leaf, graphs with up to 8 vertices, and some specially constructed examples.
Additional Information
The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays.
Time: 8 AM Pacific / 10 AM 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.