Pancyclicity of k-ary n-cube networks with faulty vertices and edges

DOI10.1016/J.DAM.2011.09.006MaRDI QIDQ765363zbMATH OpenOpenAlexFDO

Authors Jing Li, Di Liu, Jun Yuan

Publication date 19 March 2012

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

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

zbMATH Keywords

interconnection networkspancyclicity\(k\)-ary \(n\)-cubesfault-tolerant

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
• Edge-bipancyclicity in conditional edge-faulty \(k\)-ary \(n\)-cubes
• Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
• Embedding long cycles in faulty \(k\)-ary \(2\)-cubes

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Embedding cycles of various lengths into star graphs with both edge and vertex faults
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Fault tolerance of vertex pancyclicity in alternating group graphs
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Lee distance and topological properties of k-ary n-cubes
• On embedding cycles into faulty twisted cubes
• Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
• Pancyclicity of ternary n-cube networks under the conditional fault model
• Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube

Cited in

(19)

• Fault-Tolerant Panconnectivity of Augmented Cubes AQn
• Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• One-to-one disjoint path covers on multi-dimensional tori
• Regular connected bipancyclic spanning subgraphs of torus networks
• Panconnectivity of n-dimensional torus networks with faulty vertices and edges
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Edge-fault-tolerant pancyclicity of arrangement graphs
• Pancyclicity of ternary n-cube networks under the conditional fault model
• Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
• The super spanning connectivity and super spanning laceability of tori with faulty elements
• Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
• Pancyclicity of restricted hypercube-like networks under the conditional fault model

This page was built for publication: Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges

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