The reliability analysis based on the generalized connectivity in balanced hypercubes

DOI10.1016/j.dam.2020.12.011zbMath1456.05092MaRDI QIDQ2223684

Chao Wei, Jou-Ming Chang, Rong-xia Hao

Publication date: 1 February 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.12.011

zbMATH Keywords

connectivity; balanced hypercubes; edge-disjoint trees; internally disjoint trees; generalized connectivity

Mathematics Subject Classification ID

05C05: Trees

05C65: Hypergraphs

05C40: Connectivity

Related Items

The generalized 4-connectivity of locally twisted cubes, The generalized 3-connectivity of burnt pancake graphs and godan graphs, Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes, The generalized 4-connectivity of pancake graphs, The \(h\)-restricted connectivity of balanced hypercubes, The generalized 3-connectivity of two kinds of regular networks, Reliability assessment of the divide-and-swap cube in terms of generalized connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
• Two node-disjoint paths in balanced hypercubes
• The generalized 4-connectivity of hypercubes
• A solution to a conjecture on the generalized connectivity of graphs
• On the difference of two generalized connectivities of a graph
• Various cycles embedding in faulty balanced hypercubes
• The generalized 3-connectivity of star graphs and bubble-sort graphs
• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• Pendant tree-connectivity
• The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
• The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
• Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
• On two generalized connectivities of graphs
• Edge-disjoint Hamiltonian cycles of balanced hypercubes
• Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes
• Two kinds of generalized connectivity of dual cubes
• The generalized 3-connectivity of graph products
• Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
• Note on the hardness of generalized connectivity
• Matching preclusion for balanced hypercubes
• The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
• The generalized 4-connectivity of exchanged hypercubes
• The generalized connectivity of the line graph and the total graph for the complete bipartite graph
• The \(h\)-edge tolerable diagnosability of balanced hypercubes
• Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
• On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
• On extra connectivity and extra edge-connectivity of balanced hypercubes
• The generalized connectivity of complete equipartition 3-partite graphs
• Conditional diagnosability of balanced hypercubes under the PMC model
• Symmetric Property and Reliability of Balanced Hypercube
• Generalized Connectivity of Graphs
• Rainbow trees in graphs and generalized connectivity
• Conditional connectivity
• The generalized connectivity of complete bipartite graphs
• Graphs with large generalized 3-connectivity
• The Generalized Connectivity of Data Center Networks
• The generalized 3-connectivity of Lexicographic product graphs
• The generalized 3-connectivity of Cartesian product graphs