Ferrero, D. Connectivity of path graphs. (English) Zbl 1100.05056 Acta Math. Univ. Comen., New Ser. 72, No. 1, 59-66 (2003). The author determines a lower bound for the degree of a graph \(G\), forcing its path graph \(P_k(G)\) to be connected. This minimal degree guarantees that the iterated path graph is connected as well, and it is used also for determining an upper bound for the diameter of iterated path graphs. Reviewer: Martin Knor (Bratislava) Cited in 1 Document MSC: 05C40 Connectivity 05C38 Paths and cycles Keywords:connectivity; diameter; path graph; superconnectivity PDFBibTeX XMLCite \textit{D. Ferrero}, Acta Math. Univ. Comen., New Ser. 72, No. 1, 59--66 (2003; Zbl 1100.05056) Full Text: EuDML EMIS