Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees

DOI10.1016/J.DISC.2012.06.007zbMATH Open1251.05077OpenAlexW2074661375MaRDI QIDQ456645FDOQ456645

Authors: Hengzhe Li, Weihua Yang, Jixiang Meng 

Publication date: 16 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.06.007

Recommendations

• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
• Hamiltonian laceability of bubble-sort graphs with edge faults
• Hamilton paths in Cayley graphs on Coxeter groups. I.
• Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes

zbMATH Keywords

Cayley graphfault tolerancesymmetric groupJohnson graphHamiltonian laceability

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Symmetric groups (20B30)

Cites Work

• Conditional connectivity of Cayley graphs generated by transposition trees
• Linearly many faults in Cayley graphs generated by transposition trees
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Linear array and ring embeddings in conditional faulty hypercubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Hyper Hamiltonian laceability on edge fault star graph
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Embedding of cycles in arrangement graphs
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• Hamiltonian-laceability of star graphs
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Title not available (Why is that?)
• Hamiltonian laceability of bubble-sort graphs with edge faults
• Fault-free longest paths in star networks with conditional link faults
• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• Hamilton cycles and paths in butterfly graphs
• Hamiltonian cycles in the shuffle-exchange network

Cited In (14)

• Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
• The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
• 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
• Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults
• The spanning cyclability of Cayley graphs generated by transposition trees
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
• Hamiltonian laceability of bubble-sort graphs with edge faults
• Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien's model
• The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
• Fault-tolerant Hamiltonian laceability of balanced hypercubes

This page was built for publication: Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees

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