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

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

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

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

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

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

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

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

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

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

fact follows from the fact that the graph is arc-transitive and self-complementary. The strongly regular graphs with parameters of this form (for an...

Split graph String graph Strongly regular graph Threshold graph Total graph Tree (graph theory). Trellis (graph) Turán graph Ultrahomogeneous graph Vertex-transitive...

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

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

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

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 spectral graph theory has expanded to vertex-varying graphs often encountered in many real-life applications. Strongly regular graph Algebraic connectivity...

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

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

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

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

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

consider Turán graphs to be a trivial case of strong regularity and therefore exclude them from the definition of a strongly regular graph. The class of...

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

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

The Suzuki graph is a strongly regular graph with parameters ( 1782 , 416 , 100 , 96 ) {\displaystyle (1782,416,100,96)} . Its automorphism group has...