Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements

DOI10.1016/j.dam.2010.10.015zbMath1214.68087OpenAlexW1980664067MaRDI QIDQ629361

Shi-ying Wang, Chun-Fang Li, Shang-Wei Lin

Publication date: 9 March 2011

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

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

zbMATH Keywords

torusfault toleranceinterconnection network\(k\)-ary \(n\)-cubepanconnectivitypath embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (16)

Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks ⋮ Existence of 3-regular subgraphs in Cartesian product of cycles ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ Pancyclicity of OTIS (swapped) networks based on properties of the factor graph ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Structure connectivity and substructure connectivity of wheel networks ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Fault tolerance in \(k\)-ary \(n\)-cube networks ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Structure connectivity and substructure connectivity of bubble-sort star graph networks ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks ⋮ Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ On conditional connectivity of the Cartesian product of cycles

Cites Work

• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Optimal fault-tolerant embedding of paths in twisted cubes
• Dense sets and embedding binary trees into hypercubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Embedding graphs as isometric medians
• Efficient embeddings of ternary trees into hypercubes.
• On rank vs. communication complexity
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
• Embedding complete trees into the hypercube

This page was built for publication: Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements