Generating sequences of clique-symmetric graphs via Eulerian digraphs Original Research Article

Let image be an infinite sequence of graphs with image having pn vertices. This sequence is called image-removable if image, and image for every image and every vertex subset S of image that induces a image. Each graph in such a sequence has a high degree of symmetry: every way of removing the vertices of any fixed number of disjoint imageʹs yields the same subgraph. Here we construct such sequences using componentwise Eulerian digraphs as generators. The case in which each image is regular is also studied, where Cayley digraphs based on a finite group are used.