On restricted connectivities of permutation graphs
From MaRDI portal
Publication:4680413
DOI10.1002/NET.20056zbMATH Open1078.05050OpenAlexW4241943798MaRDI QIDQ4680413FDOQ4680413
Authors: C. Balbuena, Xavier Marcote, P. 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
Recommendations
- scientific article; zbMATH DE number 5519216
- On the 3-restricted edge connectivity of permutation graphs
- On optimizing \(m\)-restricted edge connectivity of generalized permutation graphs.
- Distance and connectivity measures in permutation graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
Cites Work
- Title not available (Why is that?)
- On the extraconnectivity of graphs
- Synthesis of reliable networks - a survey
- 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
- On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
- On diameter of permutation graphs
- Title not available (Why is that?)
- Connectivity of generalized prisms over G
- Large survivable nets and the generalized prisms
- Title not available (Why is that?)
Cited In (30)
- Highly connected star product graphs
- Title not available (Why is that?)
- A Tight Lower Bound on the Size of Planar Permutation Networks
- Cyclic arc-connectivity in a Cartesian product digraph
- Connectivity measures in matched sum graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Some remarks on \(\lambda _{p,q}\)-connectedness
- Title not available (Why is that?)
- The super-connectivity of Kneser graphs
- Connectivity of strong products of graphs
- Title not available (Why is that?)
- Sufficient conditions for \(k\)-restricted edge connected graphs
- The super-connectivity of the Kneser graph \(KG(n,3)\)
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- On the geodetic number of permutation graphs
- Reliability of interconnection networks modeled by Cartesian product digraphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Distance and connectivity measures in permutation graphs
- On the broadcast domination number of permutation graphs
- Large survivable nets and the generalized prisms
- The fractional metric dimension of permutation graphs
- Title not available (Why is that?)
- Disjunctive total domination in permutation graphs
- On super edge-connectivity of product graphs
- On super connectivity of Cartesian product graphs
- On the 3-restricted edge connectivity of permutation graphs
- Neighborhood conditions for graphs to be super restricted edge connected
- On optimizing \(m\)-restricted edge connectivity of generalized permutation graphs.
- \((G_1, G_2)\)-permutation graphs
This page was built for publication: On restricted connectivities of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680413)
