Super-connectivity and super-edge-connectivity for some interconnection networks
From MaRDI portal
Publication:1406242
DOI10.1016/S0096-3003(02)00223-0zbMath1025.05037OpenAlexW2022224739MaRDI QIDQ1406242
Y-Chuang Chen, Jimmy J. M. Tan, Shin-Shin Kao, Lih-Hsing Hsu
Publication date: 9 September 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00223-0
Related Items (52)
Edge fault tolerance analysis of a class of interconnection networks ⋮ The super connectivity of folded crossed cubes ⋮ Restricted connectivity for three families of interconnection networks ⋮ Strong Menger connectivity with conditional faults of folded hypercubes ⋮ Fault-tolerant analysis of a class of networks ⋮ LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS ⋮ Conditional diagnosability of the round matching composition networks ⋮ Linearly many faults in arrangement graphs ⋮ Vulnerability of super edge-connected networks ⋮ The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph ⋮ The Component (Edge) Connectivity of Round Matching Composition Networks ⋮ Structure fault tolerance of hypercubes and folded hypercubes ⋮ Fault-tolerant diameter for three family interconnection networks ⋮ Models and methods for solving the problem of network vulnerability ⋮ Structure fault tolerance of balanced hypercubes ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ Edge-fault tolerance of hypercube-like networks ⋮ Super connectivity of balanced hypercubes ⋮ The spanning laceability on the faulty bipartite hypercube-like networks ⋮ Wide diameter for two families of interconnection networks ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ Super connectivity of folded twisted crossed cubes ⋮ K-restricted edge connectivity for some interconnection networks ⋮ Reliability analysis of bijective connection networks in terms of the extra edge-connectivity ⋮ Fault-tolerant Hamiltonian connectedness of cycle composition networks ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ On the reliability of modified bubble-sort graphs ⋮ Hamiltonian properties of twisted hypercube-like networks with more faulty elements ⋮ Super connectivity of \(k\)-regular interconnection networks ⋮ A recursively construction scheme for super fault-tolerant Hamiltonian graphs ⋮ Some results about the reliability of folded hypercubes ⋮ Linearly many faults in 2-tree-generated networks ⋮ The panpositionable panconnectedness of augmented cubes ⋮ A lower bound on the size of \(k\)-neighborhood in generalized cubes ⋮ Maximally local connectivity and connected components of augmented cubes ⋮ On the spanning connectivity and spanning laceability of hypercube-like networks ⋮ FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS ⋮ On the extra edge-connectivity of hypercubes ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ Super edge-connectivity of mixed Cayley graph ⋮ On super edge-connectivity of product graphs ⋮ An efficient distributed algorithm for canonical labeling on directed split-stars ⋮ On the bipanpositionable bipanconnectedness of hypercubes ⋮ On the sizes of bi-\(k\)-maximal graphs ⋮ On the existence of edge cuts leaving several large components ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ Minimum neighborhood in a generalized cube ⋮ Structure connectivity and substructure connectivity of twisted hypercubes ⋮ The extra connectivity of the enhanced hypercubes ⋮ Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model ⋮ Generalized matching networks and their properties
Cites Work
This page was built for publication: Super-connectivity and super-edge-connectivity for some interconnection networks
