Topics in graph automorphisms and reconstruction
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1952951
- scientific article; zbMATH DE number 2149407
- scientific article; zbMATH DE number 3853103
- scientific article; zbMATH DE number 2123603
- Automorphic decompositions of graphs
- Algebraic graph invariants and reconstruction
- scientific article; zbMATH DE number 3871411
- Topics in Graph Theory
- Topics in structural graph theory
- scientific article; zbMATH DE number 3869374
Cited in
(31)- A complete classification of 5-regular circulant graphs that allow cyclic orthogonal double covers
- Reconstructing trees from traces
- 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
- Some Ulam's reconstruction problems for quantum states
- 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
- scientific article; zbMATH DE number 3851135 (Why is no real title available?)
- scientific article; zbMATH DE number 3855149 (Why is no real title available?)
- scientific article; zbMATH DE number 3943825 (Why is no real title available?)
- scientific article; zbMATH DE number 1952951 (Why is no real title available?)
- Generating symmetric graphs
- scientific article; zbMATH DE number 2149407 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- Chromatic numbers of suborbital graphs for some Hecke groups
- Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density
- Symmetry induced group consensus
- Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
- 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
- Graph reconstruction from connected triples
- Exploiting automorphisms of temporal graphs for fast exploration and rendezvous
- Simplicial surfaces with given automorphism group
- On (r,c)-constant, planar and circulant graphs
- Reconstruction of shredded random matrices
- Coloring graphs as complete graph invariants
This page was built for publication: Topics in graph automorphisms and reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814153)