The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Revisiting two classical results on graph spectra.”

Connectivity of path graphs

Martin Knor, L'udovít Niepel (2000)

Discussiones Mathematicae Graph Theory

Similarity:

We prove a necessary and sufficient condition under which a connected graph has a connected P₃-path graph. Moreover, an analogous condition for connectivity of the Pₖ-path graph of a connected graph which does not contain a cycle of length smaller than k+1 is derived.