A note on stability of graphs
From MaRDI portal
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.
Recommendations
Cited in
(23)- A note on fragile graphs
- Degrees of autostability relative to strong constructivizations of graphs
- Stability theorems for cancellative hypergraphs
- Stability of graph pairs
- Unexpected symmetries in unstable graphs
- A remark on the stability of saturated generic graphs
- Stability of arc-transitive graphs
- Composite graphs with stability index one
- A NOTE ON THE GRAPH CONTINUITY
- scientific article; zbMATH DE number 4063144 (Why is no real title available?)
- scientific article; zbMATH DE number 4063154 (Why is no real title available?)
- scientific article; zbMATH DE number 4075101 (Why is no real title available?)
- Stability of Reeb Graphs of Closed Curves
- scientific article; zbMATH DE number 4198031 (Why is no real title available?)
- On unstable branching graphs
- Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis
- Unstable graphs: a fresh outlook via TF-automorphisms
- Improving an upper bound on the stability number of a graph
- A Gallai’s Theorem type result for the edge stability of graphs
- Stable graphs: distributions and line-breaking construction
- Stable Poisson graphs in one dimension
- Stability of Rose Window graphs
- Stability in CAN-free graphs
This page was built for publication: A note on stability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790126)
