Hamiltonian laceability of bubble-sort graphs with edge faults

DOI10.1016/J.INS.2007.01.017MaRDI QIDQ881895zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
• Fault-tolerant Hamiltonian laceability of hypercubes.
• One conjecture of bubble-sort graphs

Cites work

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

Cited in

(27)

• Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
• Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs
• Survey on path and cycle embedding in some networks
• A note on Hamiltonian decomposition of bubble-sort graphs
• Double declined subnetwork reliability analysis in bubble-sort networks under node fault model
• Conditional connectivity of recursive interconnection networks respect to embedding restriction
• Fault-tolerant edge-pancyclicity of locally twisted cubes
• Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• Subnetwork preclusion for bubble-sort networks
• Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
• Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Structure connectivity and substructure connectivity of bubble-sort star graph networks
• 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
• Generalized measures of fault tolerance for bubble sort networks
• Fault tolerance in bubble-sort graph networks
• One conjecture of bubble-sort graphs
• The spanning cyclability of Cayley graphs generated by transposition trees
• Extra (component) connectivity and diagnosability of bubble sort networks
• Estimating the subsystem reliability of bubblesort networks
• Conditional edge-fault Hamiltonicity of augmented cubes
• Fault-tolerant Hamiltonian laceability of balanced hypercubes
• The \(Q_{n,k,m}\) graph: a common generalization of various popular interconnection networks
• Structure connectivity and substructure connectivity of wheel networks

This page was built for publication: Hamiltonian laceability of bubble-sort graphs with edge faults

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