| Information | |
|---|---|
| has gloss | eng: Let G = (V,E) be a regular graph with v vertices and degree k. G is said to be strongly regular if there are also integers λ and μ such that: |
| lexicalization | eng: strongly regular graph |
| instance of | c/Graph families |
| Media | |
|---|---|
| media:img | Paley13.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint
