Searches , social queries for GRAPH AUTOMORPHISM
Search references for GRAPH AUTOMORPHISM. Phrases containing GRAPH AUTOMORPHISM
See searches and references containing GRAPH AUTOMORPHISM!
Search references for GRAPH AUTOMORPHISM. Phrases containing GRAPH AUTOMORPHISM
See searches and references containing GRAPH AUTOMORPHISM!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
Graph_automorphism
Bijection between the vertex set of two graphs
a mapping of a graph onto itself, i.e., when G and H are one and the same graph, the isomorphism is called an automorphism of G. Graph isomorphism is
Graph_isomorphism
Isomorphism of an object to itself
nontrivial automorphism: negation. Considered as a ring, however, it has only the trivial automorphism. Generally speaking, negation is an automorphism of any
Automorphism
Graph where all pairs of vertices are automorphic
of graph theory, an automorphism is a permutation of the vertices such that edges are mapped to edges and non-edges are mapped to non-edges. A graph is
Vertex-transitive_graph
Graph in which all ordered pairs of linked nodes are automorphic
v 2 . {\displaystyle f(v_{1})=v_{2}.} In other words, a graph is symmetric if its automorphism group acts transitively on ordered pairs of adjacent vertices
Symmetric_graph
Cubic graph with 12 vertices and 18 edges
vertex is 3. It is one of the five smallest cubic graphs possessing only a single graph automorphism, the identity: every vertex can be distinguished topologically
Frucht_graph
Unsolved problem in computational complexity theory
problems. Finding a graph's automorphism group. Counting automorphisms of a graph. The recognition of self-complementarity of a graph or digraph. A clique
Graph_isomorphism_problem
Undirected graph with no non-trivial symmetries
identity mapping of a graph is always an automorphism, and is called the trivial automorphism of the graph. An asymmetric graph is a graph for which there are
Asymmetric_graph
Cubic graph with 10 vertices and 15 edges
graph can be transformed into every other such path by a symmetry of the graph. It is one of only 13 cubic distance-regular graphs. The automorphism group
Petersen_graph
"field automorphisms" (generated by a Frobenius automorphism), and g is the order of the group of "graph automorphisms" (coming from automorphisms of the
List_of_finite_simple_groups
Graph defined from a mathematical group
{\displaystyle \sigma :V(\Gamma )\to V(\Gamma )} be an arbitrary automorphism of the colored directed graph Γ {\displaystyle \Gamma } , and let h = σ ( e ) {\displaystyle
Cayley_graph
Distance-regular graph with 56 vertices
neighborhood of any vertex in the Gosset graph is isomorphic to the Schläfli graph. The automorphism group of the Gosset graph is isomorphic to the Coxeter group
Gosset_graph
Positive-definite integral set of repeated points with Abelian group-rank 24
lattice. G0×G1×G2 is the order of the automorphism group of the lattice G∞×G1×G2 is the order of the automorphism group of the corresponding deep hole
Niemeier_lattice
Graph where all pairs of edges are automorphic
mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an automorphism of G that maps
Edge-transitive_graph
4-regular undirected graph in mathematics
Robertson graph is one of the smallest graphs with cop number 4. The Robertson graph is not a vertex-transitive graph; its full automorphism group is isomorphic
Robertson_graph
Bipartite non-Hamiltonian polyhedral graph
faces are nine quadrilaterals. This can be designed so that each graph automorphism corresponds to a symmetry of the polyhedron, in which case three of
Herschel_graph
alternating path; see alternating. automorphism A graph automorphism is a symmetry of a graph, an isomorphism from the graph to itself. bag One of the sets
Glossary_of_graph_theory
Graph with all vertices of degree 3
the five smallest cubic graphs without any symmetries: it possesses only a single graph automorphism, the identity automorphism. According to Brooks' theorem
Cubic_graph
Vertices connected in pairs by edges
graphs with large automorphism groups: vertex-transitive, arc-transitive, and distance-transitive graphs; strongly regular graphs and their generalizations
Graph_(discrete_mathematics)
Planar graph with 4 nodes and 5 edges
forbidden minors, the family of graphs obtained is the family of pseudoforests. The full automorphism group of the diamond graph is a group of order 4 isomorphic
Diamond_graph
Set of unordered triples from a vertex set
regular two-graphs, strongly regular graphs, and also finite groups because many regular two-graphs have interesting automorphism groups. A two-graph is not
Two-graph
Graph where any two nodes of equal distance are isomorphic
distance-transitive graph is interesting partly because it has a large automorphism group. Some interesting finite groups are the automorphism groups of distance-transitive
Distance-transitive_graph
Concept in graph theory
In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers λ , μ ≥ 0
Strongly_regular_graph
Graph property
distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group. The intersection
Distance-regular_graph
One of two different regular graphs with 16 vertices
polynomial, making it a graph determined by its spectrum. The 5-regular Clebsch graph is a Cayley graph with an automorphism group of order 1920, isomorphic
Clebsch_graph
Undirected graph named after S. S. Shrikhande
The automorphism group of the Shrikhande graph is of order 192. It acts transitively on the vertices, on the edges and on the arcs of the graph. Therefore
Shrikhande_graph
Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Hofman Graph H(12
List_of_graphs
Graph representing edges of another graph
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
Line_graph
3-regular graph with 30 vertices and 45 edges
to five edges in the Tutte–Coxeter graph is equivalent to any other such path by one such automorphism. This graph is the spherical building associated
Tutte–Coxeter_graph
Bipartite, 3-regular undirected graph
The automorphism group of the Pappus graph is a group of order 216. It acts transitively on the vertices, on the edges and on the arcs of the graph. Therefore
Pappus_graph
Cubic graph with 28 vertices and 42 edges
independent set including v, leaving behind the Coxeter graph. The automorphism group of the Coxeter graph is a group of order 336. It acts transitively on the
Coxeter_graph
Cubic graph with 8 vertices and 12 edges
same number of vertices. The Wagner graph is a vertex-transitive graph but is not edge-transitive. Its full automorphism group is isomorphic to the dihedral
Wagner_graph
Graph of chess rook moves
be extended to an automorphism of the whole graph. A rook's graph can also be viewed as the line graph of a complete bipartite graph Kn,m — that is, it
Rook's_graph
16-regular graph with 27 vertices and 216 edges
to an automorphism of the whole graph. If a graph is 5-ultrahomogeneous, it is ultrahomogeneous for every k; the only finite connected graphs of this
Schläfli_graph
Undirected graph with 14 vertices
and no vertex embedded into a point within an edge. The automorphism group of the Heawood graph is isomorphic to the projective linear group PGL2(7), a
Heawood_graph
Area of discrete mathematics
particularly automorphism groups and geometric group theory, focuses on various families of graphs based on symmetry in algebraic graph theory. Such a
Graph_theory
5-vertex-connected graph and a 5-edge-connected graph. The Errera graph is not a vertex-transitive graph and its full automorphism group is isomorphic
Errera_graph
Mathematical group
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
Outer_automorphism_group
Basic concept of graph theory
mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that
Connectivity_(graph_theory)
Graph with nodes connected in a closed chain
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if
Cycle_graph
by an automorphism, that is, an isomorphism of the object to itself. This idea applies also to graphs. For example, consider the simple graph G {\displaystyle
Fibration_symmetry
graph. The group theorist Jack McLaughlin discovered that the automorphism group of this graph had a subgroup of index 2 which was a previously undiscovered
McLaughlin_graph
Assignment of colors to graph vertices that destroys all symmetries
least as hard as graph automorphism, but no harder than graph isomorphism". A coloring of a given graph is distinguishing for that graph if and only if
Distinguishing_coloring
Generalization of graph theory
definition of equality, graphs are self-dual: ( H ∗ ) ∗ = H {\displaystyle \left(H^{*}\right)^{*}=H} A hypergraph automorphism is an isomorphism from a
Hypergraph
Branch of mathematics
second branch of algebraic graph theory involves the study of graphs in connection to group theory, particularly automorphism groups and geometric group
Algebraic_graph_theory
Graph that can be embedded in the plane
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect
Planar_graph
Geometric graph with unit edge lengths
In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting
Unit_distance_graph
In graph-theoretic mathematics, a biregular graph or semiregular bipartite graph is a bipartite graph G = ( U , V , E ) {\displaystyle G=(U,V,E)} for which
Biregular_graph
Strongly regular graph
parameters (77,16,0,4). The automorphism group is of order 887040 and is isomorphic to the stabilizer of a point in the automorphism group of NL2(10)" Slide
M22_graph
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
Homogeneous_graph
Undirected cubic graph with 12 vertices and 18 edges
NP-complete. Tietze's graph has chromatic number 3, chromatic index 4, girth 3 and diameter 3. The independence number is 5. Its automorphism group has order
Tietze's_graph
degree 22. Thus all 100 vertices have degree 22 each. The automorphism group of the Higman–Sims graph is a group of order 88,704,000 isomorphic to the semidirect
Higman–Sims_graph
Methodic assignment of colors to elements of a graph
coloring of a graph is an orbit of a coloring under the action of the automorphism group of the graph. The colors remain labeled; it is the graph that is unlabeled
Graph_coloring
vertices. The automorphism group of the Tutte graph is Z/3Z, the cyclic group of order 3. The characteristic polynomial of the Tutte graph is : ( x − 3
Tutte_graph
7-regular undirected graph with 50 nodes and 175 edges
Hoffman-Singleton graph. It should instead be ( − 1 ) a b y {\displaystyle (-1)^{a}by} as written here.) The automorphism group of the Hoffman–Singleton graph is a
Hoffman–Singleton_graph
Infinite graph without small cliques
for these graphs, every automorphism of the graph has more than one orbit. Henson, C. Ward (1971), "A family of countable homogeneous graphs", Pacific
Henson_graph
Planar graph with 5 nodes and 6 edges
mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar, undirected graph with 5 vertices
Butterfly_graph
Undirected unit-distance graph requiring four colors
In graph theory, a branch of mathematics, the Moser spindle (also called the Mosers' spindle or Moser graph) is an undirected graph, named after mathematicians
Moser_spindle
(sequence A159192 in the OEIS). The Brinkmann graph is not a vertex-transitive graph and its full automorphism group is isomorphic to the dihedral group of
Brinkmann_graph
4-vertex-connected and a 4-edge-connected graph. It has book thickness 3 and queue number 3. The graph is not 1-planar. It has an automorphism group of order 54. This is
Holt_graph
On graphs with given symmetry groups
that the automorphism group of each of them is isomorphic to G {\displaystyle G} . The main idea of the proof is to observe that the Cayley graph of G, with
Frucht's_theorem
in graphs. IV. Linear arboricity". Networks. 11 (1): 69–72. doi:10.1002/net.3230110108. MR 0608921.. Babai, László (June 9, 1994). "Automorphism groups
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
24-vertex symmetric bipartite cubic graph
state-transition graph is the Nauru graph. In other words, it is the arrangement graph A 4 , 3 {\displaystyle A_{4,3}} . The automorphism group of the Nauru graph is
Nauru_graph
Tree graph with one central node and leaves of length 1
star has large automorphism group, namely, the symmetric group on k letters. Stars may also be described as the only connected graphs in which at most
Star_(graph_theory)
graph, it has chromatic index three. The automorphism group of the Gray graph is a group of order 1296. It acts transitively on the edges the graph but
Gray_graph
Aspect of mathematical group theory
precisely the outer automorphism of S6. Being an automorphism, the map must preserve the order of elements, but unlike inner automorphisms, it does not preserve
Automorphisms of the symmetric and alternating groups
Automorphisms_of_the_symmetric_and_alternating_groups
Regular graph with girth more than twice its diameter
in graph theory. Although all the known Moore graphs are vertex-transitive graphs, any of degree 57 cannot be vertex-transitive, as its automorphism group
Moore_graph
Fortnow has written a concise proof of this theorem. ⊕P contains the graph automorphism problem, and in fact this problem is low for ⊕P. It also trivially
Parity_P
Graph with 24 vertices and 36 edges
and 16. The McGee graph is the smallest cubic cage that is not a vertex-transitive graph. The automorphism group of the McGee graph, meaning its group
McGee_graph
largest distance-transitive graph with degree 11 and diameter ≤ 4.[citation needed] The automorphism group of the Livingstone graph is the sporadic simple
Livingstone_graph
Pictorial representation of symmetry
D4, there is a single non-trivial automorphism (Out = C2, the cyclic group of order 2), while for D4, the automorphism group is the symmetric group on three
Dynkin_diagram
Triangle-free graph requiring four colors
graph is the smallest triangle-free graph with its chromatic number. The full automorphism group of the Grötzsch graph is isomorphic to the dihedral group
Grötzsch_graph
Graph made from disjoint union of complete graphs
to an automorphism of the whole graph. With only two exceptions, the cluster graphs and their complements are the only finite homogeneous graphs, and infinite
Cluster_graph
rounded up. This graph is not vertex-transitive: its automorphism group has one orbit on vertices of size 8, and one of size 4. The Chvátal graph is Hamiltonian
Chvátal_graph
Class of undirected graphs defined from systems of sets
Bibcode:2008arXiv0811.2981R. Ramras, Mark; Donovan, Elizabeth (2011), "The automorphism group of a Johnson graph", SIAM Journal on Discrete Mathematics, 25 (1): 267–270
Johnson_graph
Index of articles associated with the same name
illustrates the cyclic subgroups of a group Circulant graph, a graph with an automorphism which permutes its vertices cyclically. This set index article
Cyclic_graph
Infinite graph containing all countable graphs
to an automorphism of the whole graph is expressed by saying that the Rado graph is ultrahomogeneous. In particular, there is an automorphism taking
Rado_graph
Graph in which every two vertices are adjacent
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique
Complete_graph
Type of graph in graph theory
; Yellen, J. (2004). Handbook of Graph Theory. CRC Press. p. 491. ISBN 1-58488-090-2. Babai, L (1996). "Automorphism groups, isomorphism, reconstruction"
Half-transitive_graph
Geometry with 7 points and 7 lines
The automorphism group GL(3, 2) of the group (Z2)3 is that of the Fano plane, and has order 168. As with any incidence structure, the Levi graph of the
Fano_plane
Semi-symmetric cubic graph with 110 vertices and 165 edges
existence of five and only five semi-symmetric cubic bipartite graphs whose automorphism groups act primitively on each partition. The smallest has 110
110-vertex Iofinova–Ivanov graph
110-vertex_Iofinova–Ivanov_graph
Two special graphs in graph theory
bipartite. It can be derived from the 28-vertex Coxeter graph. The automorphism group of the Klein graph is the group PGL2(7) of order 336, which has PSL2(7)
Klein_graphs
Cubic distance-regular graph with 102 nodes and 153 edges
Biggs–Smith graph is one of the 13 such graphs. The automorphism group of the Biggs–Smith graph is a group of order 2448 isomorphic to the projective
Biggs–Smith_graph
Undirected bipartite graph with 112 vertices and 168 edges
most one point. The automorphism group of the Ljubljana graph is a group of order 168. It acts transitively on the edges the graph but not on its vertices:
Ljubljana_graph
Graph with a triangular truncated trapezohedron as its skeleton
Thus, it is a planar unit-distance graph that is not a matchstick graph. The automorphism group both of the Dürer graph and of the Dürer solid (in either
Dürer_graph
Bipartite 4-regular graph with 20 nodes and 40 edges
It is also 4-vertex-connected and 4-edge-connected. The automorphism group of the Folkman graph (its group of symmetries) combines the 5 ! {\displaystyle
Folkman_graph
3-edge-connected graph. It has book thickness 3 and queue number 2. The graph is 1-planar. The automorphism group of the Dyck graph is a group of order
Dyck_graph
Sporadic simple group
fixes a Steiner system S(3,6,22) with 77 hexads, whose full automorphism group is the automorphism group M22.2 of M22. M22 has three rank 3 permutation representations:
Mathieu_group_M22
Outer automorphism group of a free group on n generators
outer automorphism group of the fundamental group of that surface. Given any finite graph with fundamental group F n {\displaystyle F_{n}} , the graph can
Out(Fn)
Natural number
In graph theory, all graphs with four or fewer vertices are planar, however, there is a graph with five vertices that is not: K5, the complete graph with
5
′ {\displaystyle w'} . A Whitehead automorphism, or Whitehead move, of F n {\displaystyle F_{n}} is an automorphism τ ∈ Aut ( F n ) {\displaystyle \tau
Whitehead's_algorithm
Graph often embedded in the Klein bottle
3-vertex-connected and 3-edge-connected perfect graph. The automorphism group of the Franklin graph is of order 48 and is isomorphic to Z/2Z×S4, the
Franklin_graph
Solid with 12 equal pentagonal faces
replicated in the properties of this graph, which are distance-transitive, distance-regular, and symmetric. The automorphism group has order a hundred and twenty
Regular_dodecahedron
The Suzuki graph is a strongly regular graph with parameters ( 1782 , 416 , 100 , 96 ) {\displaystyle (1782,416,100,96)} . Its automorphism group has order
Suzuki_graph
Undirected graph acted on by a vertex-transitive cyclic group of symmetries
cyclic graph, but this term has other meanings. Circulant graphs can be described in several equivalent ways: The automorphism group of the graph includes
Circulant_graph
Graph representing faces of another graph
mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each
Dual_graph
Constructs with triply-connected vertices
Estrada index and Kirchhoff index. Aut is the order of the Automorphism group of the graph. A Hamiltonian circuit (where present) is indicated by enumerating
Table_of_simple_cubic_graphs
Graph with same nodes as but complementary connections to another
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, but
Complement_graph
On existence of a strongly regular graph
exist a strongly regular graph with parameters (99,14,1,2)? More unsolved problems in mathematics In graph theory, Conway's 99-graph problem is an unsolved
Conway's_99-graph_problem
thickness 3 and queue number 2. The Hoffman graph is not a vertex-transitive graph and its full automorphism group is a group of order 48 isomorphic to
Hoffman_graph
travel, tourism, insurance
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
GRAPH AUTOMORPHISM
travel, tourism, insurance