Two families of strongly regular graphs with the 4-vertex condition (Q1322231)

Graphs \(G=(V(G),E(G))\) are undirected, without loops and multiple edges. Subgraphs are induced (or strong) subgraphs. \(G\) is called a rank-3 graph if its automorphism group acts transitively on vertices, edges and nonedges. \(G\) is called strongly regular if all vertices have the same number of neighbors, all pairs of adjacent vertices have the same number of common neighbors, and all pairs of nonadjacent vertices have the same number of common neighbors. Two subgraphs of \(G\) are of the same type with respect to the pair \((x,y)\) of not necessarily distinct vertices \(x,y \in V(G)\), if both contain \(x,y\) and there exists an isomorphism of one onto the other mapping \(x\) to \(x\) and \(y\) to \(y\). The graph \(G\) satisfies the \(t\)-vertex condition on the edges (resp. on the nonedges or on the vertices), if for every \(i\), \(2 \leq i \leq t\), the number of \(i\)-vertex subgraphs of every fixed type with respect to a pair \((x,y)\) of adjacent (resp. nonadjacent or coinciding) vertices is the same for all edges (resp. nonedges or vertices). If the graph \(G\) satisfies the \(t\)-vertex condition on the vertices, on the edges, and on the nonedges, we say that \(G\) is a graph with the \(t\)-vertex condition. Two infinite families of strongly regular graphs are constructed. All graphs from these families satisfy the 4-vertex condition (in sense of \textit{M. D. Hestenes} and \textit{D. G. Higman} [SIAM-AMS Proc. 4, 141-159 (1971; Zbl 0253.05127)]) on the edges and on the nonedges, but they are not rank-3 graphs.