Strongly regular graph
Graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
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 {\displaystyle \lambda ,\mu \geq 0} every two adjacent vertices have λ common neighbours, and every two non-adjacent vertices have μ common neighbours. Such a strongly regular graph is denoted by srg(v, k, λ, μ).
Nº Q692823 ★
Common · Knowledge
Strongly regular graph
Graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
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 {\displaystyle \lambda ,\mu \geq 0} every two adjacent vertices have λ common neighbours, and every two non-adjacent vertices have μ common neighbours. Such a strongly regular graph is denoted by srg(v, k, λ, μ).
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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 {\displaystyle \lambda ,\mu \geq 0} every two adjacent vertices have λ common neighbours, and every two non-adjacent vertices have μ common neighbours. Such a strongly regular graph is denoted by srg(v, k, λ, μ). Its complement graph is also strongly regular: it is an srg(v, v − k − 1, v − 2 − 2k + μ, v − 2k + λ). If a graph G is strongly regular with μ > 0, then G is distance-regular with diameter 2. Likewise, if G is strongly regular with λ = 1, then it is locally linear.
Text: Wikipédia, CC BY-SA 4.0. · Image: User:Tomruen (Public domain) ·
Related cards
Complete graph
Simple undirected graph in which every pair of distinct vertices is connected by a unique edge
Nº Q45715 ★
Graph theory
Study of graphs, which are mathematical structures used to model pairwise relations between objects
Nº Q131476 ★★★★
Graph coloring
Assignment of colors to elements of a graph subject to certain constraints
Nº Q504843 ★★
Spectral graph theory
The study of the properties of a graph in relationship to matrices associated with the graph
Nº Q3180727 ★
Dynkin diagram
Pictoral representation of symmetry
Nº Q5319218 ★
Shortest path problem
Problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Nº Q1058754 ★★