The Cameron graph is a strongly regular graph of parameters . This means that it has 231 vertices, 30 edges per vertex, 9 triangles per edges, and 3 two-edge paths between every two non-adjacent vertices.[1]
It can be obtained from a Steiner system (a collection of 22 elements and 6-element blocks with each triple of elements covered by exactly one block). In this construction, the 231 vertices of the graph correspond to the 231 unordered pairs of elements. Two vertices are adjacent whenever they come from two disjoint pairs whose union belongs to one of the blocks.[1]
It is one of a small number of strongly regular graphs on which the Mathieu group M22 acts as symmetries taking every vertex to every other vertex. The smaller M22 graph is another.[2]
^ abBrouwer, A. E. (1986), "Uniqueness and nonexistence of some graphs related to M22" (PDF), Graphs and Combinatorics, 2 (1): 21–29, doi:10.1007/BF01788073, MR 1117128
^Crnković, Dean; Mostarac, Nina; Švob, Andrea (2021), Distance-regular graphs obtained from the Mathieu groups, arXiv:2101.02790
The Camerongraph is a strongly regular graph of parameters ( 231 , 30 , 9 , 3 ) {\displaystyle (231,30,9,3)} . This means that it has 231 vertices, 30...
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...
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...
In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...
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...
mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...
In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph...
Hamming graphs are a special class of graphs named after Richard Hamming and used in several branches of mathematics (graph theory) and computer science...
combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...
automorphism group is the Mathieu group M22. Camerongraph Higman–Sims graph Gewirtz graph "Mesner graph with parameters (77,16,0,4). The automorphism...
The Cameron Highlands (Malay: Tanah Tinggi Cameron, Chinese: 金馬崙高原, Tamil: கேமரன் மலை) is a district in Pahang, Malaysia, occupying an area of 712.18 square...
In the mathematical field of graph theory, a Smith graph is either of two kinds of graph. It is a graph whose adjacency matrix has largest eigenvalue at...
of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may...
FanGraphs.com is a website run by Fangraphs Inc., located in Arlington, Virginia, and created and owned by David Appelman that provides statistics for...
Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph J ( n , k ) {\displaystyle J(n...
similar seasons in 2013; Cabrera again won the MVP. Dave Cameron disagreed, in a FanGraphs article: Over the last two years, we have seen two of 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...
of elements of order 11 are fused under an outer automorphism. Camerongraph M22 graph Adem, Alejandro; Milgram, R. James (1995), "The cohomology of the...
Global Information
