Strongly regular graph
Concept in graph theory / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Strongly regular graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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
- every two adjacent vertices have λ common neighbours, and
- every two non-adjacent vertices have μ common neighbours.
Quick Facts Graph families defined by their automorphisms, → ...
Close
Such a strongly regular graph is denoted by srg(v, k, λ, μ); its "parameters" are the numbers in (v, k, λ, μ). Its complement graph is also strongly regular: it is an srg(v, v − k − 1, v − 2 − 2k + μ, v − 2k + λ).
A strongly regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever λ = 1.