A family of non-Cayley cores based on vertex-transitive or strongly regular self-complementary graphs

Marko Orel

Given a finite simple graph $\Gamma$ on $n$ vertices its complementary prism is the graph $\Gamma \bar{\Gamma }$ that is obtained from $\Gamma$ and its complement $\bar{\Gamma }$ by adding a perfect matching, whe…