strongly regular graph
graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
Facts
3 properties- Instance of
- self-complementary graph class
- Subclass of
- regular graph[2]
- Studied by
- graph theory[3]
🏷️ Also known as
en SRG
en strongly regular graph
en strongly-regular graph
de Stark regulärer Graph
fa گراف قویا منتظم
fr graphe fortement régulier
hu erősen reguláris gráf
ja 強正則グラフ
ko 강한 정규 그래프
pl graf silnie regularny
pt grafo fortemente regular
ro graf tare regulat
ru сильно регулярный граф
uk сильно регулярний граф
zh 強正則圖
zh 强正则图
🔖 Identifiers · 7
- OpenAlex ID
- C133875400
- Freebase ID
- /m/04zk6c
- Graphclasses.org ID
- gc_1185
- MathWorld ID
- StronglyRegularGraph
- Microsoft Academic ID (discontinued)
- 133875400
- Topic's main category
- Category:Strongly regular graphs
- Wolfram Language entity code
- Entity["GraphClass", "StronglyRegular"]
🔗 Connections
Examples 10
Subtypes 5
Maintained by WikiProject 1
Studied by 1
Subclass of 1
Topic's main category 1
← Category's main topic 1
Press Enter · cited answer in seconds
0 sources
Summary
strongly regular graph is a self-complementary graph class[1].