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...

graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices. The complete graph Km is strongly regular...

In mathematics, strongly regular might refer to: Strongly regular graph Strongly regular ring, or "strongly von Neumann regular" ring This disambiguation...

In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices...

mathematical graph theory, the Higman–Sims graph is a 22-regular undirected graph with 100 vertices and 1100 edges. It is the unique strongly regular graph srg(100...

of graph theory, the Schläfli graph, named after Ludwig Schläfli, is a 16-regular undirected graph with 27 vertices and 216 edges. It is a strongly regular...

of graph theory, a conference graph is a strongly regular graph with parameters v, k = (v − 1)/2, λ = (v − 5)/4, and μ = (v − 1)/4. It is the graph associated...

of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with...

Tutte's fragment Tutte graph Young–Fibonacci graph Wagner graph Wells graph Wiener–Araya graph Windmill graph The strongly regular graph on v vertices and...

linear graphs. Certain Kneser graphs, and certain strongly regular graphs, are also locally linear. The question of how many edges locally linear graphs can...

there 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...

construction forms a regular map and shows that the Petersen graph has non-orientable genus 1. The Petersen graph is strongly regular (with signature srg(10...

The Games graph is a strongly regular graph with 729 vertices. Every edge belongs to a unique triangle, so it is a locally linear graph, the largest...

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...

Outerplanar graph Random graph Regular graph Scale-free network Snark (graph theory) Sparse graph Sparse graph code Split graph String graph Strongly regular graph...

undirected graph with 100 vertices and 1800 edges. It is a rank 3 strongly regular graph with parameters (100,36,14,12) and a maximum coclique of size 10...

see orientation. 2.  For the strong perfect graph theorem, see perfect. 3.  A strongly regular graph is a regular graph in which every two adjacent vertices...

by stating that an n × n {\displaystyle n\times n} rook's graph is a strongly regular graph with parameters srg ⁡ ( n 2 , 2 n − 2 , n − 2 , 2 ) {\displaystyle...

A strongly regular graph is defined as follows. Let G = (V,E) be a regular graph with v vertices and degree k. G is said to be strongly regular if there...

distance-regular graphs, and strongly regular graphs), and on the inclusion relationships between these families. Certain of such categories of graphs are sparse...

and distance-transitive graphs; strongly regular graphs and their generalizations distance-regular graphs. Two edges of a graph are called adjacent if...

is a strongly regular graph with certain kinds of parameter values. John H. Smith (June 2–14, 1969). "Some properties of the spectrum of a graph". In...

In graph theory, the Games graph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1...

regular two-graphs, strongly regular graphs, and also finite groups because many regular two-graphs have interesting automorphism groups. A two-graph...

field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with...

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...

field of graph theory, the Chang graphs are three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly regular, with the...

field of graph theory, the Brouwer–Haemers graph is a 20-regular undirected graph with 81 vertices and 810 edges. It is a strongly regular graph, a distance-transitive...

The M22 graph, also called the Mesner graph or Witt graph, is the unique strongly regular graph with parameters (77, 16, 0, 4). It is constructed from...

2O(√n log2 n) was obtained first for strongly regular graphs by László Babai (1980), and then extended to general graphs by Babai & Luks (1983). Improvement...