Connectivity of path graphs
From MaRDI portal
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.
Recommendations
Cited in
(19)- Long path connectivity of regular graphs
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
- Edge-connectivity in \(P_k\)-path graphs
- Flexible graph connectivity
- A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
- Fan-type theorem for path-connectivity
- On the characterization of path graphs
- Connection graphs
- A survey on path graphs connectedness
- Path Separability of Graphs
- scientific article; zbMATH DE number 1151850 (Why is no real title available?)
- scientific article; zbMATH DE number 1744097 (Why is no real title available?)
- Vector connectivity in graphs
- scientific article; zbMATH DE number 2172752 (Why is no real title available?)
- Diameter of path graphs
- Flexible Graph Connectivity
- On tree-connection of generalized line graphs
- Graph of \(uv\)-paths in connected graphs
- Path transferability of graphs
This page was built for publication: Connectivity of path graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725182)
