Connectivity of path graphs (Q2725182)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Connectivity of path graphs |
scientific article; zbMATH DE number 1618905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity of path graphs |
scientific article; zbMATH DE number 1618905 |
Statements
Connectivity of path graphs (English)
0 references
24 March 2002
0 references
path graphs
0 references
connectivity
0 references
connected graph
0 references
The authors continue the study of path graphs. They give a necessary and sufficient condition for a connected graph (with some restrictions) to have a connected \(P_k\)-path graph, \(k\geq 2\). Moreover, they give an analogous condition for the connectivity of the \(P_3\)-path graph of a connected graph.
0 references
