Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Kamyab, Khalid"'
For a graph $G$, $k(G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_{1}$-connectivity of a connected graph is the minimum number of vertices whose deletion gives a disconnected graph wit
Externí odkaz:
http://arxiv.org/abs/2009.04831
