The reliability analysis based on the generalized connectivity in balanced hypercubes

DOI10.1016/J.DAM.2020.12.011MaRDI QIDQ2223684zbMATH OpenOpenAlexFDO

Authors 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

balanced hypercubesconnectivityedge-disjoint treesgeneralized connectivityinternally disjoint trees

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
• Generalized connectivity of generalized hypercubes
• Structure and substructure connectivity of balanced hypercubes
• The generalized 4-connectivity of hypercubes
• The generalized 3-connectivity of two kinds of regular networks

Cites work

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

Cited in

(22)

• Reliability analysis of the generalized balanced hypercube
• 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
• The generalized 4-connectivity of hypercubes
• The generalized connectivity of data center networks
• Generalized connectivity of generalized hypercubes
• Graph theoretic characterization and reliability of the generalized Boolean n-cube network
• 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
• Reliability analysis of exchanged hypercubes based on the path connectivity
• The generalized 4-connectivity of burnt pancake graphs
• The generalized 3-connectivity of BCCC data center networks
• The pendant-tree connectivity of some regular graphs
• The h-faulty-block connectivity of n-dimensional balanced hypercube
• Reliability analysis of godan graphs in terms of generalized 4-connectivity
• The generalized 3-connectivity of a family of regular networks
• The generalized 4-connectivity of balanced hypercubes
• Edge-disjoint Hamiltonian cycles in balanced hypercubes with applications to fault-tolerant data broadcasting
• k-path-connectivity of balanced hypercubes for k = 3, 4

This page was built for publication: The reliability analysis based on the generalized connectivity in balanced hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223684)