• Diameter and Connectivity of Finite Simple Graphs II 

      [OWP-2024-09] Hibi, Takayuki; Saeedi Madani, Sara (Mathematisches Forschungsinstitut Oberwolfach, 2024-09-05)
      Let $G$ be a finite simple non-complete connected graph on $[n] = \{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter ...