On 3-isoregularity of multicirculants

Klavdija Kutnar, Dragan Marušič, Štefko Miklavič

A graph is said to be $k$-{\em isoregular} if any two vertex subsets of cardinality at most $k$, that induce subgraphs of the same isomorphism type, have the same number of neighbo…