edge connectivity

• https://mathworld.wolfram.com/EdgeConnectivity.html
  • edge connectivity – The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges $\lambda(G)$ whose deletion from a graph $G$ disconnects $G$.
• assumed
  • bisection bandwidth upper bounds edge connectivity by a linear function – By definition
• unknown source
  • minimum degree upper bounds edge connectivity by a linear function – Removing edges incident to the minimum degree vertex disconnects the graph.
  • graph class complete has unbounded edge connectivity – Parameter is unbounded for the graph class of cliques.
  • graph class bipartite has unbounded edge connectivity
• Tran2022
  • page 19 : bounded twin-cover number does not imply bounded edge connectivity – Observation 3.4. Twin Cover Number is incomparable to Maximum Clique, Domatic Number and Distance to Disconnected.
  • page 19 : bounded edge connectivity does not imply bounded twin-cover number – Observation 3.4. Twin Cover Number is incomparable to Maximum Clique, Domatic Number and Distance to Disconnected.