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.
Formally, an automorphism of a graph G = (V, E) is a permutation σ of the vertex set V, such that the pair of vertices (u, v) form an edge if and only if the pair (σ(u), σ(v)) also form an edge. That is, it is a graph isomorphism from G to itself. Automorphisms may be defined in this way both for directed graphs and for undirected graphs.
The composition of two automorphisms is another automorphism, and the set of automorphisms of a given graph, under the composition operation, forms a group, the automorphism group of the graph. In the opposite direction, by Frucht's theorem, all groups can be represented as the automorphism group of a connected graph – indeed, of a cubic graph.[1][2]
^Frucht, R. (1938), "Herstellung von Graphen mit vorgegebener abstrakter Gruppe", Compositio Mathematica (in German), 6: 239–250, ISSN 0010-437X, Zbl 0020.07804.
^Frucht, R. (1949), "Graphs of degree three with a given abstract group" (PDF), Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321, archived from the original on Jun 9, 2012.
and 21 Related for: Graph automorphism information
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...
nontrivial automorphism: negation. Considered as a ring, however, it has only the trivial automorphism. Generally speaking, negation is an automorphism of any...
graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of G, there is an automorphism f...
itself, i.e., when G and H are one and the same graph, the bijection is called an automorphism of G. If a graph is finite, we can prove it to be bijective...
computationally equivalent to the problem of computing the automorphism group of a graph, and is weaker than the permutation group isomorphism problem...
{\displaystyle \sigma :V(\Gamma )\to V(\Gamma )} be an arbitrary automorphism of the colored directed graph Γ {\displaystyle \Gamma } , and let h = σ ( e ) {\displaystyle...
second branch of algebraic graph theory involves the study of graphs in connection to group theory, particularly automorphism groups and geometric group...
"field automorphisms" (generated by a Frobenius automorphism), and g is the order of the group of "graphautomorphisms" (coming from automorphisms of the...
construction as a Kneser graph. The Petersen graph is a core: every homomorphism of the Petersen graph to itself is an automorphism. As shown in the figures...
Brouwer–Haemers graph Local McLaughlin graph Perkel graph Gewirtz graph A symmetric graph is one in which there is a symmetry (graphautomorphism) taking any...
In mathematics, the outer automorphism group of a group, G, is the quotient, Aut(G) / Inn(G), where Aut(G) is the automorphism group of G and Inn(G) is...
alternating path; see alternating. automorphism A graphautomorphism is a symmetry of a graph, an isomorphism from the graph to itself. bag One of the sets...
mapping of a graph onto itself is always an automorphism, and is called the trivial automorphism of the graph. An asymmetric graph is a graph for which there...
cyclic graph, but this term has other meanings. Circulant graphs can be described in several equivalent ways: The automorphism group of the graph includes...
the five smallest cubic graphs without any symmetries: it possesses only a single graphautomorphism, the identity automorphism. According to Brooks' theorem...
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges...
up to an element of S6 (an inner automorphism)) yields an outer automorphism S6 → S6. This map is an outer automorphism, since a transposition does not...
The automorphism group of a graph is the automorphism group of its complement. The complement of every triangle-free graph is a claw-free graph, although...
k-ultrahomogeneous graph is a graph in which every isomorphism between two of its induced subgraphs of at most k vertices can be extended to an automorphism of the...
to an automorphism of the whole graph is expressed by saying that the Rado graph is ultrahomogeneous. In particular, there is an automorphism taking...
Global Information