unstable graph

unstable graph

[¦ən‚stā·bəl ′graf]
(mathematics)
A graph from which it is not possible to delete an edge to produce a subgraph whose group of automorphisms is a subgroup of the group of automorphisms of the original graph.