Discrete Mathematics and Combinatorics Commons^™

Generating Sequences Of Clique-Symmetric Graphs Via Eulerian Digraphs, John P. Mcsorley, Thomas D. Porter

Articles and Preprints

Let {G_p1,G_p2, . . .} be an infinite sequence of graphs with G_pn having pn vertices. This sequence is called K_p-removable if G_p1 ≅ K_p, and G_pn − S ≅ G_p(n−1) for every n ≥ 2 and every vertex subset S of G_pn that induces a K_p. Each graph in such a sequence has a high degree of symmetry: every way of removing the vertices of any fixed number of disjoint K_p’s yields the same …