Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.Hibi, TakayukiSaeedi Madani, Sara2024-10-172024-10-172024https://oa.tib.eu/renate/handle/123456789/17004https://doi.org/10.34657/16026Let $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 of $G$. The final goal of this paper is to determine all sequences of integers $(n,f,d,k)$ with $n\geq 8$, $f\geq 0$, $d\geq 2$ and $k\geq 1$ for which there exists a finite simple non-complete connected graph on $[n]$ with $f=f(G)$, $d=\mathrm{diam}(G)$ and $k=\kappa(G)$.eng510DiameterFree VerticesVertex ConnectivityReport