strongly regular graph
graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
Press Enter · cited answer in seconds
0 sources
strongly regular graph
Summary
strongly regular graph is a self-complementary graph class[1]. It draws 66 Wikipedia views per month (self_complementary_graph_class category, ranking #3 of 7).[2]
Key Facts
- strongly regular graph's image is recorded as Up 2 21 t0 E6.svg[3].
- strongly regular graph's instance of is recorded as self-complementary graph class[4].
- strongly regular graph's subclass of is recorded as regular graph[5].
- strongly regular graph's Commons category is recorded as Strongly regular graphs[6].
- strongly regular graph's Freebase ID is recorded as /m/04zk6c[7].
- strongly regular graph's topic's main category is recorded as Category:Strongly regular graphs[8].
- strongly regular graph's studied by is recorded as graph theory[9].
- strongly regular graph's MathWorld ID is recorded as StronglyRegularGraph[10].
- strongly regular graph's Wolfram Language entity code is recorded as Entity["GraphClass", "StronglyRegular"][11].
- strongly regular graph's maintained by WikiProject is recorded as WikiProject Mathematics[12].
- strongly regular graph's Microsoft Academic ID is recorded as 133875400[13].
- strongly regular graph's OpenAlex ID is recorded as C133875400[14].
- strongly regular graph's graphclasses.org ID is recorded as gc_1185[15].
Why It Matters
strongly regular graph draws 66 Wikipedia views per month (self_complementary_graph_class category, ranking #3 of 7).[2] It has Wikipedia articles in 10 language editions, a strong signal of global cultural recognition.[16] It is known by 3 alternative names across languages and contexts.[17]