Search

The Hoffman-Singleton graph is the unique strongly regular graph with parameters (50, 7, 0, 1). A well-known hypothesis states that a distance-regular graph in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph has intersection array {50, 42, 1; 1, 2, 50} or {50, 42, 9; 1, 2, 42}. In the present paper, we prove this hypothesis under the assumption that a distance-regular graph is a Terwilliger graph and the graph diameter is at most 5. [ABSTRACT FROM AUTHOR]

Possible orders and fixed-point subgraphs of automorphisms of a generalized octagon of order (2, 4) are found. The vertex-symmetric generalized octagon of order (2, 4) is proved to be classical. [ABSTRACT FROM AUTHOR]

It is proved that any set of finite pairwise nonisomorphic weakly cospectral connected pseudographs, as well as any set of pseudodigraphs satisfying various additional conditions, is finite. [ABSTRACT FROM AUTHOR]