×

Connectivity of path graphs. (English) Zbl 1100.05056

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.

MSC:

05C40 Connectivity
05C38 Paths and cycles
PDFBibTeX XMLCite
Full Text: EuDML EMIS