Unchanging the diameter of k-ary n-cube networks with faulty vertices
DOI10.1080/00207160.2014.890189zbMATH Open1308.05046OpenAlexW2096645297MaRDI QIDQ4983265FDOQ4983265
Authors: Jing Li, Yuxing Yang, Shiying 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
Recommendations
- Fault tolerance in \(k\)-ary \(n\)-cube networks
- Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
- Restricted fault diameter of hypercube networks
- Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
- The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity
Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- Lee distance and topological properties of k-ary n-cubes
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Fault diameter of interconnection networks
- Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
- Fault diameter of Cartesian product graphs
- Fault-diameter of Cartesian graph bundles
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
- The fault-diameter of Cartesian products
- Changing and unchanging the diameter of a hypercube
- Diameter variability of cycles and tori
Cited In (3)
This page was built for publication: Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983265)
