(Q3115556)

English

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

Statements

0 references
Paley13.svg
495 × 495; 10 KB
0 references
Odd graph O4.svg
559 × 562; 17 KB
0 references
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit