e/Distance-regular graph

Information
has gloss	eng: In mathematics, a distance-regular graph is a regular graph such that for any two vertices v and w at distance i the number of vertices adjacent to w and at distance j from v is the same. Every distance-transitive graph is distance regular. Indeed, distance-regular graphs were introduced as a combinatorial generalization of distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group.
lexicalization	eng: Distance regular graph
lexicalization	eng: distance-regular graph
instance of	c/Graph families

Meaning
French
has gloss	fra: En théorie des graphes, un graphe est distance-régulier si pour tous sommets u, v \in V, le nombre de sommets voisins de u à distance i et le nombre de sommets voisins de v à distance j ne dépendent que de i, j et de la distance d(u,v) entre u et v.
lexicalization	fra: graphe distance-régulier