This paper considers instability of graphs in all of its possible forms. First, four theorems (one with two interesting special cases) are presented, each of which shows that graphs satisfying certain conditions are unstable. Several infinite families of graphs are investigated. For each family, the four general theorems are used to find and prove enough theorems particular for the family to explain the instability of all graphs in the family up to a certain point. A very dense family of edge-transitive unstable graphs is constructed and, at the other extreme, an unstable graph is constructed whose only symmetry is trivial. Finally, the four theorems are shown to be able to explain all instability. © 2007 Elsevier Inc. All rights reserved.
Wilson, S. (2008). Unexpected symmetries in unstable graphs. Journal of Combinatorial Theory. Series B, 98(2), 359–383. https://doi.org/10.1016/j.jctb.2007.08.001