Reconstruction of k-orbits of a permutation group

DOI10.1007/BF01137455zbMath0672.20008MaRDI QIDQ1120004

Valeriy B.Mnukhin

Publication date: 1987

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

finite permutation groupedge reconstruction problemk-orbits

Mathematics Subject Classification ID

Representations of finite symmetric groups (20C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Finite-type invariants for graphs and graph reconstructions ⋮ Reconstructing under group actions. ⋮ Stories about groups and sequences ⋮ The \(k\)-orbit reconstruction and the orbit algebra

Cites Work

• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• A note on the line reconstruction problem
• Graph reconstruction—a survey

This page was built for publication: Reconstruction of k-orbits of a permutation group