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

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

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

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

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

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

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

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

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

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

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

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

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

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

the spectral graph theory has expanded to vertex-varying graphs often encountered in many real-life applications. Strongly regular graph Algebraic connectivity...

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

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

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

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

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

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 Suzuki graph is a strongly regular graph with parameters ( 1782 , 416 , 100 , 96 ) {\displaystyle (1782,416,100,96)} . Its automorphism group has...

invented the notions of partial geometry, association scheme, and strongly regular graph and started a systematic study of difference sets to construct symmetric...

In graph theory, the Berlekamp–Van Lint–Seidel graph is a locally linear strongly regular graph with parameters ( 243 , 22 , 1 , 2 ) {\displaystyle (243...

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

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