Live briefing
Everything about Graph automorphism
Mapping a graph onto itself without changing edge-vertex connectivity
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph automorphismA 5-minute orientation
- Skim a recent paper: Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph SymmetriesInfluential work since 2022
- Pick up a classic book: TOPICS IN GRAPH AUTOMORPHISMS AND RECONSTRUCTIONThe most-reprinted book on the subject
- Read the landmark paper: On the full automorphism group of a graphCited 209 times
- Go sideways: Skew-symmetric graphA closely related topic
- Go sideways: Graph isomorphismA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
On the full automorphism group of a graph
Exact epidemic models on graphs using graph-automorphism driven lumping
A Generating Set for the Automorphism Group of a Graph Group
Graph automorphism perception algorithms in computer-enhanced structure elucidation
Automorphism group of the complete transposition graph
The Automorphism Group of a Johnson Graph
The automorphism group of the alternating group graph
The automorphism group of a graph product with no SIL
🆕 Influential since 2022
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
Graph Automorphism Shuffles from Pile-Scramble Shuffles
On automorphism group of orthogonality graph of finite semisimple rings
Zero-divisor graph of a ring with respect to an automorphism
Automorphism group of 2-token graph of the Hamming graph
📚 Books worth reading
TOPICS IN GRAPH AUTOMORPHISMS AND RECONSTRUCTIONJosef Lauri, Josef Lauri · 2003
First International Congress of Chinese MathematiciansInternational Congress of Chinese Mathematicians (1st 1998 Beijing, China), China) International Congress of Chinese Mathematicians 1998 (Beijing · 2001- 📕More Sabidussi-type theorems for stabilityDouglas D. Grant · 1974
The classification of minimal graphs with given abelian automorphism groupWilliam C. Arlinghaus · 1985
The reconstruction of trees from their automorphism groupsMatatyahu Rubin · 1993- 📕On the number of automorphisms of an algebraH. H. Teh · 1975
Harmonic analysis and representation theory for groups acting on homogeneous treesAlessandro Figá-Talamanca, Claudio Nebbia · 1991- 📕Contributions of Mexican Mathematicians Abroad in Pure and Applied MathematicsFernando Galaz-Garcia, Juan Carlos Pardo · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Skew-symmetric graph In graph theory, a branch of mathematics, a skew-symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by…
- Graph isomorphism In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f:V(G)→V(H) such that any two vertices u and v of G…
- Zero-symmetric graph In the mathematical field of graph theory, a zero-symmetric graph is a connected graph in which each vertex has exactly three incident edges and, for each…
- Frucht's theorem Frucht's theorem is a result in algebraic graph theory, conjectured by Dénes Kőnig in 1936 and proved by Robert Frucht in 1939. It states that every finite…
- Circulant graph In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes…
- Algebraic graph theory Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs. This is in contrast to geometric, combinatori…
- Hypergraph In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge…
- Folkman graph In the mathematical field of graph theory, the Folkman graph is a graph with 20 vertices and 40 edges. It is quartic (four edges meet at each vertex),…