Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
From MaRDI portal
Publication:354456
DOI10.1007/s00373-012-1172-0zbMath1268.05117OpenAlexW1984293343MaRDI QIDQ354456
Zhizhang Shen, Eddie Cheng, Ke Qiu, László Lipták
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1172-0
Related Items (7)
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs ⋮ A strong connectivity property of the generalized exchanged hypercube ⋮ Reliability analysis of Cayley graphs generated by transpositions ⋮ Neighbor connectivity of two kinds of Cayley graphs ⋮ Structural Properties of Generalized Exchanged Hypercubes ⋮ Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
Cites Work
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Bipancyclic properties of Cayley graphs generated by transpositions
- Linearly many faults in Cayley graphs generated by transposition trees
- Cyclic Vertex Connectivity of Star Graphs
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cyclic vertex-connectivity of Cayley graphs generated by transposition trees