On restricted connectivities of permutation graphs

DOI10.1002/net.20056zbMath1078.05050OpenAlexW4241943798MaRDI QIDQ4680413

Camino Balbuena, Xavier Marcote, Pedro García-Vázquez

Publication date: 1 June 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20056

zbMATH Keywords

connectivitysuperconnectivityrestricted edge-cutrestricted cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (21)

The super-connectivity of Kneser graphs ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Disjunctive total domination in permutation graphs ⋮ On super connectivity of Cartesian product graphs ⋮ Connectivity of strong products of graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Reliability of interconnection networks modeled by Cartesian product digraphs ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Connectivity measures in matched sum graphs ⋮ The super-connectivity of Kneser graph KG(n,3) ⋮ Cyclic arc-connectivity in a Cartesian product digraph ⋮ The fractional metric dimension of permutation graphs ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ On the broadcast domination number of permutation graphs ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ On super edge-connectivity of product graphs ⋮ On the geodetic number of permutation graphs ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ Highly connected star product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of generalized prisms over G
• On computing a conditional edge-connectivity of a graph
• Extraconnectivity of graphs with large minimum degree and girth
• Distance and connectivity measures in permutation graphs
• Large survivable nets and the generalized prisms
• On the extraconnectivity of graphs
• On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
• Synthesis of reliable networks - a survey
• On diameter of permutation graphs

This page was built for publication: On restricted connectivities of permutation graphs