A note on stability of graphs (Q790126): Difference between revisions

In this paper a graph is stable if there is a sequence of all the vertices of the graph such that the consecutive removal of the vertices in sequential order, at no stage introduces new automorphisms in the resulting subgraphs. It was conjectured by the reviewer [J. Aust. Math. Soc. 15, 163-171 (1973; Zbl 0257.05116)] that for connected graphs G and H, whose complements are also connected, and whose automorphism groups are identical, then G is stable if H is. This paper provides counterexamples to this conjecture.