Back
Add Comment
Topics
Vote
Results
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
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous