Super \(p\)-restricted edge connectivity of line graphs
From MaRDI portal
Publication:730960
DOI10.1016/j.ins.2009.05.005zbMath1194.68172OpenAlexW2047928918MaRDI QIDQ730960
Publication date: 1 October 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.05.005
interconnection networksfault-toleranceline graphsrestricted connectivitysuper restricted edge-connected graphs
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
\(\{2,3\}\)-extraconnectivities of hypercube-like networks, On optimizing edge connectivity of product graphs, Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected, Edge fault tolerance of super edge connectivity for three families of interconnection networks, Conditional connectivity of star graph networks under embedding restriction, On the connectivity and restricted edge-connectivity of 3-arc graphs, Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs
- Longest fault-free paths in hypercubes with vertex faults
- On reliability of the folded hypercubes
- Substar reliability analysis in star networks
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Conditional matching preclusion sets
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Super connectivity of line graphs
- On computing a conditional edge-connectivity of a graph
- Super edge-connectivity of dense digraphs and graphs
- On the connectivity of clusters
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
- Cuts leaving components of given minimum order
- On the extraconnectivity of graphs
- Super restricted edge connectivity of regular graphs
- Line Digraph Iterations and the (d, k) Digraph Problem
- Circulants and their connectivities
- On super edge-connectivity of Cartesian product graphs
- Sufficient conditions for a graph to be super restricted edge-connected
- Synthesis of reliable networks - a survey
- Diameter vulnerability of iterated line digraphs in terms of the girth
