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 ★
Común · Saberes
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, λ, μ).
Último precio
—
Precio mínimo
—
Mediana 7 d
—
Ventas 30 d
0
Rango 30 d
—
En circulación
0
Cotización
mediana
mín – máx
ventas
Sin ventas en el periodo
Ver tabla
| Fecha | mediana | Mín | Máx | ventas |
|---|
Historial de ventas
- Última venta
- —
- Media 30 d
- —
- Mínimo 30 d
- —
- Máximo 30 d
- —
- Ventas 7 d
- 0
- Ventas 30 d
- 0
Aún no hay ventas.
Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
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.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: User:Tomruen (Public domain) ·
Cartas cercanas
Grafo completo
Nº Q45715 ★
Teoría de grafos
Campo de estudio de las matemáticas y las ciencias de la computación
Nº Q131476 ★★★★
Coloración de grafos
Nº Q504843 ★★
Teoría espectral de grafos
Nº Q3180727 ★
Diagrama de Dynkin
Nº Q5319218 ★
Problema del camino más corto
Problema que consiste en encontrar un camino entre dos vértices o nodos, de tal manera que la suma de los pesos de las aristas que lo constituyen sea mínima
Nº Q1058754 ★★