Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
From MaRDI portal
Publication:1402063
DOI10.1016/S0012-365X(02)00828-2zbMath1021.05061OpenAlexW2064527490MaRDI QIDQ1402063
Daniela Ferrero, Camino Balbuena
Publication date: 19 August 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00828-2
Related Items (7)
Edge-connectivity in \(P_k\)-path graphs ⋮ A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected ⋮ Edge-connectivity and edge-superconnectivity in sequence graphs ⋮ Diameter of path graphs ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs ⋮ Histories in Path Graphs
Cites Work
- Super edge-connectivity of dense digraphs and graphs
- The connectivity of line-graphs
- On the line-connectivity of line-graphs
- On the characterization of path graphs
- Circulants and their connectivities
- Synthesis of reliable networks - a survey
- Path graphs
- P3-isomorphisms for graphs
- Diameter in iterated path graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
