Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
From MaRDI portal
Publication:5266134
DOI10.1080/00207160.2014.953942zbMath1317.05089OpenAlexW2079469356MaRDI QIDQ5266134
Hengzhe Li, Weihua Yang, Wei-Hua He
Publication date: 30 July 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.953942
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Symmetric groups (20B30)
Related Items (1)
Cites Work
- Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Diagnosability of Cayley graphs generated by transposition trees with missing edges
- Hyper Hamiltonian laceability on edge fault star graph
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Bipancyclic properties of Cayley graphs generated by transpositions
- Fault-free longest paths in star networks with conditional link faults
- Conditional connectivity of Cayley graphs generated by transposition trees
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Linearly many faults in Cayley graphs generated by transposition trees
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- A group-theoretic model for symmetric interconnection networks
- Hamiltonian-laceability of star graphs
This page was built for publication: Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
