Tuesday, April 18, 2023 - 09:00 to 09:45
Abstract or Additional Information
In this presentation, we will analyze generated data related to graphs of maximal complexity. The data will highlight the correlation between these graphs and their K-connectivity and K-edge connectivity. We will also discuss various patterns that have been observed in graphs with the minimum and maximum number of spanning trees. Additionally, we will explore specific instances where K-connectivity fails to hold.