Edge-disjoint paths in faulty augmented cubes
Reliability and efficiency are important criteria in the design of interconnection networks and connectivity parameters play a major role in the study of fault-tolerance of networks. The paper under review studies edge-disjoint paths in augmented cubes (\(AQ_n\)) with faulty edges. For a vertex \(v \in V(G)\), the degree of \(v\) in \(G\) is denoted by \(\deg_G(v)\), and \(\delta(G) = \min \{\deg_G(v) \colon v \in V(G)\}\). It is shown that for any faulty edge set \(F \subset E (AQ_n) \) with \(\delta (AQ_n-F) \geq 2\), if \(n \geq 4\) and \(| F| \leq 4n-8\), then for any two vertices \(u,v \in V(AQ_n-F)\), there are \(\min\{\deg_{AQ_n-F} (u), \deg_{AQ_n-F} (v)\}\) edge-disjoint paths connecting \(u\) and \(v\). This result is optimal with respect to the maximum number of faulty edges. Furthermore, the \(g\)-extra edge-connectivity of \(AQ_n\) is determined for \(g=1\) and \(n \geq 2\) and for \(g=2\) and \(n \geq 4\). The \(g\)-extra-connectivity of a graph was introduced by \textit{J. Fàbrega} and \textit{M. A. Fiol} [Discrete Math. 155, No. 1--3, 49--57 (1996; Zbl 0857.05064)].
- Maximally local connectivity and connected components of augmented cubes
- Edge fault tolerance analysis of a class of interconnection networks
- Edge-disjoint paths in faulty hypercube-like networks.
- Fault-tolerant panconnectivity of augmented cubes
- On 2-extra edge connectivity of folded crossed cube
- The super connectivity of augmented cubes
- The \(g\)-extra connectivity and diagnosability of crossed cubes
- scientific article; zbMATH DE number 7448597
- Augmented cubes
- Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- Edge-independent spanning trees in augmented cubes
- Extraconnectivity of graphs with large girth
- Fault-tolerant maximal local-connectivity on bubble-sort star graphs
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- Hamiltonian-laceability of star graphs
- Longest fault-free paths in star graphs with vertex faults
- Maximally local connectivity and connected components of augmented cubes
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- On g-extra connectivity of folded hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- On strong Menger-connectivity of star graphs
- On the extraconnectivity of graphs
- Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- Strong Menger connectivity with conditional faults of folded hypercubes
- Strong Menger connectivity with conditional faults on the class of hypercube-like networks
- The super connectivity of augmented cubes
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
- Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
- The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes
- Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses
- Distance and Short Parallel Paths in Augmented Cubes
- Edge disjoint paths in enhanced hypercube with conditional faults
- Edge-disjoint paths in faulty hypercube-like networks.
- One-to-one conditional path covers on augmented cubes
- Fault-tolerant maximal local-edge-connectivity of augmented cubes
- Disjoint paths in the enhanced hypercube with a faulty subgraph
- Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs
- Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks
- Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube
- Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern
- A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs
- A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: application to Hamiltonian decomposition
- Two-disjoint-cycle-cover pancyclicity of augmented cubes
- Maximally local connectivity and connected components of augmented cubes
This page was built for publication: Edge-disjoint paths in faulty augmented cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656959)
