The clique graph K(G) of G is the intersection graph of all its (maximal) cliques. A connected graph G is self-clique whenever G âˆ¼= K(G). Self-clique graphs have been studied in several papers. Hereâ€¦ (More)

Two years ago I found large patches of an intense blue colour, with some black spots, on flints on the quay at Great Yarmouth. I looked for a possible cause, and discovered other patches similar inâ€¦ (More)

A singl~ change neighbor design SCN(v, k) is a way of selecting a sequence of cycles of length k from a complete graph on v vertices with the properties: any cycle is derived from the preceding oneâ€¦ (More)

Let {Gp1, Gp2, . . .} be an infinite sequence of graphs with Gpn having pn vertices. This sequence is called Kp-removable if Gp1 âˆ¼= Kp, and Gpn âˆ’ S âˆ¼= Gp(nâˆ’1) for every n â‰¥ 2 and every vertex subsetâ€¦ (More)