The spanning cyclability of Cayley graphs generated by transposition trees
Authors:
- Hongwei QiaoHQHongwei Qiao
- Eminjan SabirESEminjan Sabir
- Jixiang MengJMJixiang Meng
- 17 December 2022
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 328, 60-69
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Automorphism groups of Cayley graphs generated by connected transposition setsDiscrete Mathematics, 2013
- One conjecture of bubble-sort graphsInformation Processing Letters, 2011
- Conditional connectivity of Cayley graphs generated by transposition treesInformation Processing Letters, 2010
- Bipancyclic properties of Cayley graphs generated by transpositionsDiscrete Mathematics, 2010
- Linearly many faults in Cayley graphs generated by transposition treesInformation Sciences, 2007
- Conditional fault-tolerant hamiltonicity of star graphsParallel Computing, 2007
- Hamiltonian laceability of bubble-sort graphs with edge faultsInformation Sciences, 2007
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphsInformation Processing Letters, 2006
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition setsJournal of Combinatorial Theory, Series B, 2006
- Embedding longest fault-free paths onto star graphs with more vertex faultsTheoretical Computer Science, 2005