| Livingstone graph | |
|---|---|
 | |
| Vertices | 266 |
| Edges | 1463 |
| Radius | 4 |
| Diameter | 4 |
| Girth | 5 |
| Automorphisms | 175560 (J1) |
| Properties | Symmetric Distance-transitive Primitive |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Livingstone graph is a distance-transitive graph with 266 vertices and 1463 edges. Its intersection array is {11,10,6,1;1,1,5,11}. [1] It is the largest distance-transitive graph with degree 11. [2]
The automorphism group of the Livingstone graph is the sporadic simple group J1, and the stabiliser of a point is PSL(2,11). As the stabiliser is maximal in J1, it acts primitively on the graph.
As the Livingstone graph is distance-transitive, PSL(2,11) acts transitively on the set of 11 vertices adjacent to a reference vertex v, and also on the set of 12 vertices at distance 4 from v. The second action is equivalent to the standard action of PSL(2,11) on the projective line over F11; the first is equivalent to an exceptional action on 11 points, related to the Paley biplane.
In mathematics, many sets of transformations form a group under function composition; for example, the rotations around a point in the plane. It is often useful to consider the group as an abstract group, and to say that one has a group action of the abstract group that consists of performing the transformations of the group of transformations. The reason for distinguishing the group from the transformations is that, generally, a group of transformations of a structure acts also on various related structures; for example, the above rotation group acts also on triangles by transforming triangles into triangles.
Transitivity or transitive may refer to:
In the mathematical disciplines of topology and geometry, an orbifold is a generalization of a manifold. Roughly speaking, an orbifold is a topological space which is locally a finite group quotient of a Euclidean space.
This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.
In mathematics, especially in the group theoretic area of algebra, the projective linear group (also known as the projective general linear group or PGL) is the induced action of the general linear group of a vector space V on the associated projective space P(V). Explicitly, the projective linear group is the quotient group
In hyperbolic geometry, the Klein quartic, named after Felix Klein, is a compact Riemann surface of genus 3 with the highest possible order automorphism group for this genus, namely order 168 orientation-preserving automorphisms, and 168 × 2 = 336 automorphisms if orientation may be reversed. As such, the Klein quartic is the Hurwitz surface of lowest possible genus; see Hurwitz's automorphisms theorem. Its (orientation-preserving) automorphism group is isomorphic to PSL(2, 7), the second-smallest non-abelian simple group after the alternating group A5. The quartic was first described in (Klein 1878b).
In the mathematical field 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 a vertex-transitive graph if, given any two vertices v1 and v2 of G, there is an automorphism f such that
In mathematics, the ADE classification is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications, rather than a posteriori verification of a parallelism, was posed in. The complete list of simply laced Dynkin diagrams comprises
In the mathematical field of graph theory, a graph G is symmetric if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of G, there is an automorphism
In the mathematical field of graph theory, the Desargues graph is a distance-transitive, cubic graph with 20 vertices and 30 edges. It is named after Girard Desargues, arises from several different combinatorial constructions, has a high level of symmetry, is the only known non-planar cubic partial cube, and has been applied in chemical databases.
In mathematics, and especially in geometry, an object has icosahedral symmetry if it has the same symmetries as a regular icosahedron. Examples of other polyhedra with icosahedral symmetry include the regular dodecahedron and the rhombic triacontahedron.
In the mathematical field of graph theory, a transitive reduction of a directed graph D is another directed graph with the same vertices and as few edges as possible, such that for all pairs of vertices v, w a (directed) path from v to w in D exists if and only if such a path exists in the reduction. Transitive reductions were introduced by Aho, Garey & Ullman (1972), who provided tight bounds on the computational complexity of constructing them.
In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is named after Harold Scott MacDonald Coxeter.
In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and D. H. Smith.
In the mathematical field of graph theory, the Shrikhande graph is a graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with 16 vertices and 48 edges, with each vertex having degree 6. Every pair of nodes has exactly two other neighbors in common, whether or not the pair of nodes is connected.
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.
In the mathematical field of graph theory, the Biggs–Smith graph is a 3-regular graph with 102 vertices and 153 edges.
In the mathematical field of graph theory, the Nauru graph is a symmetric, bipartite, cubic graph with 24 vertices and 36 edges. It was named by David Eppstein after the twelve-pointed star in the flag of Nauru.
The Gosset graph, named after Thorold Gosset, is a specific regular graph (1-skeleton of the 7-dimensional 321 polytope) with 56 vertices and valency 27.
The 110-vertex Iofinova–Ivanov graph is, in graph theory, a semi-symmetric cubic graph with 110 vertices and 165 edges.
 | This graph theory-related article is a stub. You can help Wikipedia by expanding it. |