Edge-connectivity and super edge-connectivity of P2-path graphs

Authors:
Camino Balbuena;Daniela Ferrero
Affiliations:
Departament de Matemàtica Aplicada III, Universitat Politècnica de Catalunya, Spain;Department of Mathematics, Southwest Texas State University, 601 University Drive, San Marcos, TX
Venue:
Discrete Mathematics
Year:
2003

Citing 4
Cited 4

Super edge-connectivity of dense digraphs and graphs

Discrete Applied Mathematics - Special double volume: interconnection networks
On the characterization of path graphs

Journal of Graph Theory
P3-isomorphisms for graphs

Journal of Graph Theory
Diameter in iterated path graphs

Discrete Mathematics

A sufficient condition for Pk-path graphs being r-connected

Discrete Applied Mathematics
Edge-connectivity and edge-superconnectivity in sequence graphs

Discrete Applied Mathematics
Super p-restricted edge connectivity of line graphs

Information Sciences: an International Journal
On the connectivity and restricted edge-connectivity of 3-arc graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, λ(P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is super-λ if each minimum edge cut is trivial, and it is optimum super-λ if each minimum nontrivial edge cut consists of all the edges adjacent to one edge. We give conditions on G, for P2(G) to be super-λ and optimum super-λ.