Super connectivity of balanced hypercubes
From MaRDI portal
Publication:2449203
DOI10.1016/j.amc.2012.06.077zbMath1291.68028OpenAlexW2045336038MaRDI QIDQ2449203
Publication date: 7 May 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.06.077
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (27)
Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Cluster connectivity of hypercube-based networks under the super fault-tolerance condition ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes ⋮ Reliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivity ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest ⋮ Hamiltonian cycles of balanced hypercube with more faulty edges ⋮ Structure fault tolerance of balanced hypercubes ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ Edge-disjoint Hamiltonian cycles of balanced hypercubes ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ Structure and substructure connectivity of balanced hypercubes ⋮ Fault-tolerant Hamiltonian laceability of balanced hypercubes ⋮ On the reliability of modified bubble-sort graphs ⋮ Some results about the reliability of folded hypercubes ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ The 3-extra conditional diagnosability of balanced hypercubes under \(\mathrm{MM}^\ast\) model ⋮ Path embeddings with prescribed edge in the balanced hypercube network ⋮ Strongly Menger connectedness of data center network and \((n,k)\)-star graph ⋮ Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks
Cites Work
- Unnamed Item
- Bipanconnectivity of balanced hypercubes
- Super connectivity of Kronecker products of graphs
- The super connectivity of augmented cubes
- Super connectivity of line graphs
- On connectivity of the cartesian product of two graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- The super connectivity of exchanged hypercubes
- Restricted connectivity for three families of interconnection networks
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- On super edge-connectivity of Cartesian product graphs
- Synthesis of reliable networks - a survey
This page was built for publication: Super connectivity of balanced hypercubes
