Skip to main content
Source Link
hbm
  • 1k
  • 7
  • 14

Is this Graph parameter known?

Let $\lambda(G)$ denote the edge-connectivity of $G$.

Consider the following parameter:

$\rho(G) = \max_{X \subset V(G)} \min(\lambda(G[X]), \lambda(G[V(G) - X]))$

Has this parameter been studied? Are there any known bounds on it in terms of $\lambda(G)$?