stable graph

stable graph

[′stā·bəl ′graf]
(mathematics)
A graph from which an edge can be deleted to produce a subgraph whose group of automorphisms is a subgroup of the group of automorphisms of the original graph.
References in periodicals archive ?
Beginning about September, the usually stable graph of monetary base vs.
To prove this, we show that the set of universally stable graphs is closed under the taking of minors; polynomial-time decidability then follows from results of Robertson and Seymour [1986; 1990].
A natural next question is whether one can characterize the set of universally stable graphs.
The crucial fact we show here is that the family of universally stable graphs is a minor-closed set; this is what allows us to apply the results of Robertson and Seymour [1995].
Our objective is to show that the set of universally stable graphs is minor-closed.