The Cameron graph is a strongly regular graph of parameters ( 231 , 30 , 9 , 3 ) {\displaystyle (231,30,9,3)} . This means that it has 231 vertices, 30...
2 KB (200 words) - 00:46, 24 July 2024
Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton...
14 KB (1,251 words) - 18:45, 9 May 2025
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...
14 KB (1,253 words) - 18:25, 9 May 2025
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...
38 KB (4,860 words) - 20:28, 9 May 2025
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...
38 KB (5,168 words) - 03:42, 24 August 2024
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...
21 KB (3,468 words) - 21:22, 9 February 2025
bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the...
24 KB (2,993 words) - 04:57, 12 April 2025
the two-graph. A regular two-graph has the property that every pair of vertices lies in the same number of triples of the two-graph. Two-graphs have been...
11 KB (1,591 words) - 18:32, 9 May 2025
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In...
23 KB (2,938 words) - 21:25, 18 March 2025
The Cameron Highlands (Malay: Tanah Tinggi Cameron) is a district in Pahang, Malaysia, occupying an area of 712.18 square kilometres (274.97 sq mi). To...
30 KB (2,849 words) - 01:46, 5 April 2025
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...
3 KB (305 words) - 07:45, 18 November 2024
automorphism group is the Mathieu group M22. Cameron graph Higman–Sims graph Gewirtz graph "Mesner graph with parameters (77,16,0,4). The automorphism...
3 KB (302 words) - 18:16, 10 April 2025
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...
7 KB (85 words) - 19:28, 12 March 2024
of graph theory, a self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are...
4 KB (366 words) - 21:21, 13 December 2023
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...
13 KB (1,512 words) - 20:27, 29 August 2024
WHO reports, tables, and spreadsheets. There are also maps and timeline graphs of daily and weekly deaths worldwide. There have been reported 7,057,132...
18 KB (1,606 words) - 22:17, 22 January 2025
social graph is a graph that represents social relations between entities. It is a model or representation of a social network. The social graph has been...
14 KB (1,482 words) - 22:00, 27 April 2025
In mathematics, a k-ultrahomogeneous graph is a graph in which every isomorphism between two of its induced subgraphs of at most k vertices can be extended...
6 KB (513 words) - 22:28, 25 March 2025
Hamming graphs are a special class of graphs named after Richard Hamming and used in several branches of mathematics (graph theory) and computer science...
7 KB (651 words) - 18:01, 9 May 2025
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...
6 KB (606 words) - 16:09, 19 November 2023
the mathematical field of graph theory, the Schläfli graph, named after Ludwig Schläfli, is a 16-regular undirected graph with 27 vertices and 216 edges...
7 KB (738 words) - 18:48, 9 May 2025
mathematics, Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph J ( n , k ) {\displaystyle...
10 KB (1,302 words) - 02:44, 11 February 2025
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...
7 KB (709 words) - 07:47, 8 May 2024
two mathematicians Peter Cameron and Dima Von-Der-Flaass. The theorem is considered to be a link between group theory and graph theory as it studies redundancy...
2 KB (189 words) - 12:17, 12 April 2025
of graphs on n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Cameron, Peter J. (2004), "Automorphisms of graphs",...
5 KB (554 words) - 01:15, 6 August 2024
combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...
195 KB (20,026 words) - 13:12, 7 May 2025
FanGraphs.com is a website run by Fangraphs Inc., located in Arlington, Virginia, and created and owned by David Appelman that provides statistics for...
27 KB (2,724 words) - 10:38, 7 May 2025
Spanning tree (category Computational problems in graph theory)
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...
26 KB (3,280 words) - 19:26, 11 April 2025
a Fellow of the Royal Society of Edinburgh. Cameron, Peter J.; Lint, Jacobus Hendricus van (1975). Graph theory, coding theory, and block designs. Cambridge...
7 KB (489 words) - 12:21, 9 April 2025
Linkless embedding (redirect from Linklessly embeddable graph)
In topological graph theory, a mathematical discipline, a linkless embedding of an undirected graph is an embedding of the graph into three-dimensional...
29 KB (3,484 words) - 06:21, 9 January 2025