Reliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivity

DOI10.1016/j.dam.2023.07.013OpenAlexW4385748588MaRDI QIDQ6069146

Hong Zhang, Qifan Zhang, Shuming Zhou

Publication date: 13 November 2023

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

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

zbMATH Keywords

3-ary \(n\)-cubeconditional edge-connectivitysuper edge connectivityaverage degree edge connectivity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Extraconnectivity of \(k\)-ary \(n\)-cube networks
• K-restricted edge connectivity for some interconnection networks
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
• On conditional edge-connectivity of graphs
• The super connectivity of folded crossed cubes
• Reliability assessment for modified bubble-sort networks
• Edge-fault tolerance of hypercube-like networks
• 3-extra connectivity of 3-ary \(n\)-cube networks
• Super connectivity of balanced hypercubes
• Optimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical network
• Conditional connectivity

This page was built for publication: Reliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivity