## Abstract

Let {*G*_{p1},*G*_{p2}, . . .} be an infinite sequence of graphs with *G _{pn}* having

*pn*vertices. This sequence is called

*K*-removable if

_{p}*G*

_{p1}≅

*K*, and

_{p}*G*−

_{pn}*S*≅

*G*

_{p(n−1)}for every

*n*≥ 2 and every vertex subset

*S*of

*G*that induces a

_{pn}*K*. Each graph in such a sequence has a high degree of symmetry: every way of removing the vertices of any fixed number of disjoint

_{p}*K*’s yields the same subgraph. Here we construct such sequences using componentwise Eulerian digraphs as generators. The case in which each

_{p}*G*is regular is also studied, where Cayley digraphs based on a finite group are used.

_{pn}## Recommended Citation

McSorley, John P. and Porter, Thomas D. "Generating Sequences of Clique-Symmetric Graphs via Eulerian Digraphs." (Oct 2004).

## Comments

Published in

Discrete Mathematics, 287(1-3), 85-91.