Unchanging the diameter ofk-aryn-cube networks with faulty vertices

DOI10.1080/00207160.2014.890189zbMath1308.05046OpenAlexW2096645297MaRDI QIDQ4983265

Jing Li, Yuxing Yang, Shi-ying Wang

Publication date: 25 March 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.890189

zbMATH Keywords

diameterinterconnection networksfault-tolerancefault diameter\(k\)-ary \(n\)-cube networks

Mathematics Subject Classification ID

Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Extraconnectivity of \(k\)-ary \(n\)-cube networks
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Fault diameter of Cartesian product graphs
• Fault-diameter of Cartesian graph bundles
• Diameter variability of cycles and tori
• Fault diameter of interconnection networks
• Changing and unchanging the diameter of a hypercube
• The fault-diameter of Cartesian products
• Panconnectivity and edge-pancyclicity ofk-aryn-cubes
• Lee distance and topological properties of k-ary n-cubes
• The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model