On the 3-restricted edge connectivity of permutation graphs

DOI10.1016/J.DAM.2008.04.010zbMath1172.05036OpenAlexW1980185895MaRDI QIDQ1028132

Camino Balbuena, Xavier Marcote, Diego González-Moreno

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.010

zbMATH Keywords

connectivityperfect matchingpermutation graph\(k\)-edge degreesuper \(k\)-restricted edge connectivity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (11)

\(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ A new approach to finding the extra connectivity of graphs ⋮ Vulnerability of super edge-connected networks ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ On computing of a conditional edge connectivity of alternating group network ⋮ On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ Conditional connectivity of recursive interconnection networks respect to embedding restriction ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large graphs with given degree and diameter. II
• Connectivity of generalized prisms over G
• Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
• On computing a conditional edge-connectivity of a graph
• Extraconnectivity of graphs with large girth
• Extraconnectivity of graphs with large minimum degree and girth
• Distance and connectivity measures in permutation graphs
• Super restricted edge-connectivity of vertex-transitive graphs
• Edge-cuts leaving components of order at least three
• Large survivable nets and the generalized prisms
• On the extraconnectivity of graphs
• On the edge-connectivity and restricted edge-connectivity of a product of graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Circulants and their connectivities
• Reliability of interconnection networks modeled by a product of graphs
• Conditional connectivity
• Synthesis of reliable networks - a survey
• On restricted connectivities of permutation graphs
• On restricted edge-connectivity of graphs.

This page was built for publication: On the 3-restricted edge connectivity of permutation graphs