Definitions from Wikipedia (Distance-regular graph)
▸ noun: In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices and , the number of vertices at distance from and at distance from depends only upon , , and the distance between and .
▸ Words similar to distance-regular graph
▸ Usage examples for distance-regular graph
▸ Idioms related to distance-regular graph
▸ Wikipedia articles (New!)
▸ Words that often appear near distance-regular graph
▸ Rhymes of distance-regular graph
▸ Invented words related to distance-regular graph
▸ noun: In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices and , the number of vertices at distance from and at distance from depends only upon , , and the distance between and .
▸ Words similar to distance-regular graph
▸ Usage examples for distance-regular graph
▸ Idioms related to distance-regular graph
▸ Wikipedia articles (New!)
▸ Words that often appear near distance-regular graph
▸ Rhymes of distance-regular graph
▸ Invented words related to distance-regular graph