On extra connectivity and extra edge-connectivity of balanced hypercubes
From MaRDI portal
Publication:5737900
DOI10.1080/00207160.2016.1148813zbMath1362.05072OpenAlexW2516982167MaRDI QIDQ5737900
Publication date: 30 May 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1148813
Applications of graph theory (05C90) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (25)
Reliability analysis of the cactus-based networks ⋮ Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks ⋮ Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ \(h\)-extra \(r\)-component connectivity of interconnection networks with application to hypercubes ⋮ The largest component of faulty star graphs ⋮ A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model ⋮ Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity ⋮ Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes ⋮ 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 ⋮ Cycles embedding in balanced hypercubes with faulty edges and vertices ⋮ Structure fault tolerance of balanced hypercubes ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Edge-disjoint Hamiltonian cycles of balanced hypercubes ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Structure and substructure connectivity of balanced hypercubes ⋮ Fault tolerance analysis of hierarchical folded cube ⋮ The 3-extra conditional diagnosability of balanced hypercubes under \(\mathrm{MM}^\ast\) model ⋮ Reliability of the round matching composition networks based on \(g\)-extra conditional fault ⋮ Path embeddings with prescribed edge in the balanced hypercube network ⋮ Structure connectivity and substructure connectivity of twisted hypercubes ⋮ The \(g\)-extra connectivity and diagnosability of crossed cubes ⋮ Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks
Cites Work
- Two node-disjoint paths in balanced hypercubes
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- On \(g\)-extra connectivity of folded hypercubes
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Various cycles embedding in faulty balanced hypercubes
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- Bipanconnectivity of balanced hypercubes
- On reliability of the folded hypercubes in terms of the extra edge-connectivity
- Super connectivity of Kronecker products of graphs
- The super connectivity of augmented cubes
- Super connectivity of line graphs
- The super connectivity of shuffle-cubes
- Extraconnectivity of graphs with large girth
- On the extraconnectivity of graphs
- Matching preclusion for balanced hypercubes
- Linearly many faults in dual-cube-like networks
- The super connectivity of exchanged hypercubes
- Edge fault tolerance analysis of a class of interconnection networks
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- 3-extra connectivity of 3-ary \(n\)-cube networks
- Super connectivity of balanced hypercubes
- Linearly many faults in Cayley graphs generated by transposition trees
- Component connectivity of the hypercubes
- LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
- Symmetric Property and Reliability of Balanced Hypercube
- On the maximal connected component of a hypercube with faulty vertices III
- On super edge-connectivity of Cartesian product graphs
- Conditional connectivity
- On the maximal connected component of hypercube with faulty vertices (II)
- On the maximal connected component of hypercube with faulty vertices
- Booting Time Minimization for Real-Time Embedded Systems with Non-Volatile Memory
- Linearly many faults in arrangement graphs
This page was built for publication: On extra connectivity and extra edge-connectivity of balanced hypercubes
