regular graph
graph where each vertex has the same number of neighbors
Facts
3 properties- Instance of
- self-complementary graph class
- Studied by
- graph theory[3]
🏷️ Also known as
en k‑regular graph
en regular graphs
en regular graph
ar بيان منتظم
cs regulární graf
cs pravidelný graf
de regulärer Graph
de K-regulärer Graph
es grafo regular
fa گراف منتظم
fa گراف منظم
fr graphe régulier
he גרף רגולרי
hu reguláris gráf
hu reguláris gráfok
it grafo regolare
ja 正則グラフ
ko 정규 그래프
nl regelmatige graaf
pl graf regularny
🔖 Identifiers · 14
- OpenAlex ID
- C123482549
- Image (Wikimedia Commons)
- Cube graph.png ↗
- BabelNet ID
- 03742114n
- Encyclopædia Britannica Online ID
- topic/regular-graph
- Freebase ID
- /m/0lrt9
- Graphclasses.org ID
- gc_1149
- MathWorld ID
- RegularGraph
- Metamath statement ID
- df-rgr
- Microsoft Academic ID (discontinued)
- 123482549
- ProofWiki ID
- Definition:Regular_Graph
- Quora topic ID
- Regular-Graph
- ScienceDirect topic ID
- mathematics/regular-graph
Show all 14 identifiers +2
- Topic's main category
- Category:Regular graphs
- Wolfram Language entity code
- Entity["GraphClass", "Regular"]
🔗 Connections
Subtypes 18
Examples 1
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
regular graph is a self-complementary graph class[1].