Hamiltonian laceability of bubble-sort graphs with edge faults

DOI10.1016/j.ins.2007.01.017zbMath1115.68106OpenAlexW2064929278MaRDI QIDQ881895

Toru Araki, Yosuke Kikuchi

Publication date: 18 May 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.01.017

zbMATH Keywords

Hamiltonian cyclefault-tolerancebubble-sort graphhyper-Hamiltonian laceabilityHamiltonian laceabilitystrongly Hamiltonian laceability

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

Cyclic vertex-connectivity of Cayley graphs generated by transposition trees, Subnetwork reliability analysis of bubble-sort graph networks, Path and cycle fault tolerance of bubble-sort graph networks, The spanning cyclability of Cayley graphs generated by transposition trees, One conjecture of bubble-sort graphs, Extra (component) connectivity and diagnosability of bubble sort networks, Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, Structure connectivity and substructure connectivity of wheel networks, Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model, Constructing vertex-disjoint paths in \((n, k)\)-star graphs, Conditional connectivity of recursive interconnection networks respect to embedding restriction, THE Q_n,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS, Estimating the subsystem reliability of bubblesort networks, Fault-tolerant Hamiltonian laceability of balanced hypercubes, Fault-tolerant edge-pancyclicity of locally twisted cubes, Conditional edge-fault Hamiltonicity of augmented cubes, Generalized measures of fault tolerance for bubble sort networks, Structure connectivity and substructure connectivity of bubble-sort star graph networks, Fault tolerance in bubble-sort graph networks, Survey on path and cycle embedding in some networks, Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks, Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees, Subnetwork preclusion for bubble-sort networks

Cites Work

• Unnamed Item
• Hyper Hamiltonian laceability on edge fault star graph
• Longest fault-free paths in hypercubes with vertex faults
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• On the \(k\)-path cover problem for cacti
• Complete path embeddings in crossed cubes
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm
• A group-theoretic model for symmetric interconnection networks
• Hamiltonian-laceability of star graphs
• Hamilton cycles and paths in butterfly graphs