Reconstruction of k-orbits of a permutation group
type: Item
instance of: scholarly article
title: Reconstruction of k-orbits of a permutation group
zbMATH Open document ID: 0672.20008
DOI: 10.1007/BF01137455
published in: Mathematical Notes
publication date: 1987-01-01T00:00:00Z
review text: The edge reconstruction problem is rephrased in terms of k-orbits of an arbitrary finite permutation group. A sufficient condition, generalizing and strengthening results of Lovász and Müller, is established for orbits to be reconstructible. The proof is based on embedding the set of k-orbits in a certain algebra.
Mathematics Subject Classification ID: 20C30
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 4099546
zbMATH Keywords: edge reconstruction problem
zbMATH Keywords: k-orbits
zbMATH Keywords: finite permutation group
author: Valeriy B. Mnukhin
MaRDI profile type: Publication
cites work: Graph reconstruction—a survey
cites work: A note on the line reconstruction problem
cites work: The edge reconstruction hypothesis is true for graphs with more than n log n edges
description: scientific article; zbMATH DE number 4099546