Vertex reconstruction in Cayley graphs
type: Item
instance of: scholarly article
title: Vertex reconstruction in Cayley graphs
zbMATH Open document ID: 1182.05085
published in: Discrete Mathematics
publication date: 2009-04-08T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/786/
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 5541727
zbMATH Keywords: vertex reconstruction problem
zbMATH Keywords: Cayley graphs
zbMATH Keywords: the symmetric group
zbMATH Keywords: the hyperoctahedral group
zbMATH Keywords: signed permutations
zbMATH Keywords: sorting by reversals
zbMATH Keywords: pancake problem
author: Elena V. Konstantinova
MaRDI profile type: Publication
OpenAlex ID: W2026548724
cites work: A group-theoretic model for symmetric interconnection networks
cites work: On the diameter and bisector size of Cayley graphs
cites work: Small-diameter Cayley graphs for finite simple groups
cites work: On the diameter of Cayley graphs of the symmetric group
cites work: Genome Rearrangements and Sorting by Reversals
cites work: Combinatorics of Coxeter Groups
cites work: Q3992965
cites work: On the problem of sorting burnt pancakes
cites work: Q4039784
cites work: Sorting with fixed-length reversals
cites work: The minimum-length generator sequence problem is NP-hard
cites work: Bounds for sorting by prefix reversal
cites work: On the Diameter of the Pancake Network
cites work: Reconstruction of permutations distorted by reversal errors
cites work: On reconstruction of signed permutations distorted by reversal errors
cites work: Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
cites work: Reconstruction of objects from a minimum number of distorted patterns
cites work: Efficient reconstruction of sequences
cites work: Processor interconnection networks from Cayley graphs
DOI: 10.1016/J.DISC.2008.07.039
description: scientific article; zbMATH DE number 5541727