Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
type: Item
instance of: scholarly article
title: Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
zbMATH Open document ID: 1021.05061
DOI: 10.1016/S0012-365X(02)00828-2
author: Daniela Ferrero
author: C. Balbuena
published in: Discrete Mathematics
publication date: 2003-08-19T00:00:00Z
review text: For a graph \(G\), the \(P_2\)-path graph, \(P_2(G)\), has for vertices the set of all paths of length 2 in \(G\). Two vertices are adjacent in \(P_2(G)\) whenever the union of the corresponding paths is a path or a cycle of length 3. In the paper, there are lower bounds for the edge-connectivity of \(P_2\)-path graphs of connected graphs. Further, conditions on a graph \(G\) which force maximum edge-connectivity of \(P_2(G)\) are presented. Finally, for maximum edge-connected \(P_2\)-path graphs the authors consider nontrivial edge cuts.
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1967259
zbMATH Keywords: edge cut
zbMATH Keywords: path graph
zbMATH Keywords: super edge-connectivity
reviewed by: Martin Knor
MaRDI profile type: Publication
cites work: P3-isomorphisms for graphs
cites work: Q5461449
cites work: Q4261824
cites work: Synthesis of reliable networks - a survey
cites work: Circulants and their connectivities
cites work: Path graphs
cites work: The connectivity of line-graphs
cites work: Q3490015
cites work: Q4944758
cites work: Diameter in iterated path graphs
cites work: Q4529522
cites work: On the characterization of path graphs
cites work: On the determination problem for \(P_3\)-transformation of graphs
cites work: Q4349619
cites work: Super edge-connectivity of dense digraphs and graphs
cites work: On the line-connectivity of line-graphs
full work available at URL: s0012-365x(02)00828-2
OpenAlex ID: W2064527490
description: scientific article; zbMATH DE number 1967259