strongly regular graph (Q692823)
Jump to navigation
Jump to search
graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
- strongly-regular graph
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | strongly regular graph |
graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent |
|
Statements
Strongly regular graphs
0 references
Identifiers
1 reference
Sitelinks
Wikipedia(10 entries)
- dewiki Stark regulärer Graph
- enwiki Strongly regular graph
- frwiki Graphe fortement régulier
- huwiki Erősen reguláris gráf
- jawiki 強正則グラフ
- kowiki 강한 정규 그래프
- ptwiki Grafo fortemente regular
- ruwiki Сильно регулярный граф
- tawiki வலிமையான ஒழுங்கு கோட்டுரு
- ukwiki Сильно регулярний граф