distance-regular graph
a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and at distance k from w depends only upon j, k
Press Enter · cited answer in seconds
0 sources
distance-regular graph
Summary
distance-regular graph ranks in the top 2% of general entities by monthly Wikipedia readership (25 views/month).[1]
Key Facts
- distance-regular graph's image is recorded as Paley13.svg[2].
- distance-regular graph's image is recorded as Odd graph O4.svg[3].
- distance-regular graph's subclass of is recorded as walk-regular graph[4].
- distance-regular graph's Freebase ID is recorded as /m/026cfpz[5].
- distance-regular graph's studied by is recorded as graph theory[6].
- distance-regular graph's Wolfram Language entity code is recorded as Entity["GraphClass", "DistanceRegular"][7].
- distance-regular graph's Microsoft Academic ID is recorded as 56783289[8].
- distance-regular graph's OpenAlex ID is recorded as C56783289[9].
- distance-regular graph's graphclasses.org ID is recorded as gc_1148[10].
Why It Matters
distance-regular graph ranks in the top 2% of general entities by monthly Wikipedia readership (25 views/month).[1] It has Wikipedia articles in 7 language editions, a strong signal of global cultural recognition.[11]