Some problems on Cayley graphs
From MaRDI portal
Publication:952069
DOI10.1016/j.laa.2008.05.010zbMath1148.05037OpenAlexW1991983390MaRDI QIDQ952069
Publication date: 6 November 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.05.010
Cayley graphsdiameter problemsorting by reversalshamiltonicity problempancake problemsvertex reconstruction problem
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Cayley graphs of order 6pq and 7pq are Hamiltonian ⋮ Error-tolerant ZZW-construction ⋮ Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps ⋮ Unnamed Item ⋮ Unnamed Item ⋮ One conjecture of bubble-sort graphs ⋮ Hamiltonian cycles in unitary prefix transposition rearrangement graphs ⋮ An algorithm for finding minimal generating sets of finite groups ⋮ PLANARITY OF PERMUTABILITY GRAPHS OF SUBGROUPS OF GROUPS ⋮ The `Butterfly effect' in Cayley graphs with applications to genomics. ⋮ CAYLEY GRAPHS OF PARTIALLY ORDERED SETS ⋮ A new class of Cayley graphs ⋮ Distance-regular Cayley graphs with small valency ⋮ Remark on subgroup intersection graph of finite abelian groups ⋮ Spectrum of the transposition graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for generation of permutations
- Small-diameter Cayley graphs for finite simple groups
- Vertex reconstruction in Cayley graphs
- Hamiltonian circuits in Cayley graphs
- On the diameter of Cayley graphs of the symmetric group
- Bounds for sorting by prefix reversal
- Hamiltonian decompositions of Cayley graphs on Abelian groups
- Two edge-disjoint hamiltonian cycles in the butterfly graph
- Hamiltonian decompositions of Cayley graphs on abelian groups of even order
- Reconstruction of objects from a minimum number of distorted patterns
- On isomorphisms of finite Cayley graphs---a survey
- On the problem of sorting burnt pancakes
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Hamiltonian decompositions of Cayley graphs on abelian groups of odd order
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Reconstruction of permutations distorted by reversal errors
- On reconstruction of signed permutations distorted by reversal errors
- Combinatorics of Coxeter Groups
- Transforming cabbage into turnip
- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
- On the theory of the matching polynomial
- The minimum-length generator sequence problem is NP-hard
- Updating the hamiltonian problem—A survey
- Doubly adjacent gray codes for the symmetric group
- On the Diameter of the Pancake Network
- Efficient reconstruction of sequences
- Sparse pseudo‐random graphs are Hamiltonian
- Genome Rearrangements and Sorting by Reversals
- Vertex-transitive graphs that are not Cayley graphs. II
- Hamilton cycles and paths in butterfly graphs
- On the diameter and bisector size of Cayley graphs
This page was built for publication: Some problems on Cayley graphs