License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-7869
URL: http://drops.dagstuhl.de/opus/volltexte/2006/786/

Konstantinova, Elena

Vertex reconstruction in Cayley graphs

pdf-format:
Dokument 1.pdf (247 KB)


Abstract

In this report paper we collect recent results on the vertex reconstruction in Cayley graphs $Cay(G,S)$. The problem is stated as the problem of reconstructing a vertex from the minimum number of its $r$-neighbors that are vertices at distance at most $r$ from the unknown vertex. The combinatorial properties of Cayley graphs on the symmetric group $Sn$ and the signed permutation group $Bn$ with respect to this problem are presented. The sets of generators of $S$ are specified by applications in coding theory, computer science, molecular biology and physics.

BibTeX - Entry

@InProceedings{konstantinova:DSP:2006:786,
  author =	{Elena Konstantinova},
  title =	{Vertex reconstruction in Cayley graphs},
  booktitle =	{Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
  year =	{2006},
  editor =	{Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein},
  number =	{06201},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/786},
  annote =	{Keywords: Reconstruction problems,  Cayley graphs, the symmetric group, the signed permutation group, sorting by reversals, pancake problem}
}

Keywords: Reconstruction problems, Cayley graphs, the symmetric group, the signed permutation group, sorting by reversals, pancake problem
Seminar: 06201 - Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Issue date: 2006
Date of publication: 07.11.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI