Topics in Graph Automorphisms and Reconstruction
From MaRDI portal
Publication:2814153
DOI10.1017/CBO9781316669846zbMath1347.05001MaRDI QIDQ2814153
Raffaele Scapellato, Josef Lauri
Publication date: 20 June 2016
automorphism groupCayley graphstrongly regular graphreconstruction conjecturegraphical regular representation
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (19)
Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Presentations for vertex-transitive graphs ⋮ Orthogonal labeling for some different infinite graph classes ⋮ Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ Set recognition of decomposable graphs and steps towards their reconstruction ⋮ Size reconstructibility of graphs ⋮ Seurat games on Stockmeyer graphs ⋮ Shotgun reconstruction in the hypercube ⋮ Selecting energy efficient inputs using graph structure ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Unnamed Item ⋮ From Schur Rings to Constructive and Analytical Enumeration of Circulant Graphs with Prime-Cubed Number of Vertices ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Generating symmetric graphs ⋮ A complete classification of 5-regular circulant graphs that allow cyclic orthogonal double covers ⋮ Symmetry induced group consensus ⋮ Reconstructing trees from traces ⋮ Some Ulam’s reconstruction problems for quantum states ⋮ Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
This page was built for publication: Topics in Graph Automorphisms and Reconstruction
