On Cliques in Isoregular Graphs

Isoregular graphs are studied by considering undirected graphs without loops or multiple edges. The intersection of the neighborhoods of two vertices in a strongly regular graph is called a subgraph if the vertices a and b are adjacent and is called a subgraph if a and b are not adjacent. Each precisely 4-isoregular graph is a pseudogeometric graph. An amply regular graph with certain parameters that contains an induced subgraph on l vertices of some degrees is considered. The results show that any vertex of a clique is adjacent to a single vertex of any clique and the neighborhood of any vertex is the union of six isolated 4-cliques.