A note on stability of graphs (Q790126): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A report on stable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some remarks on stable graphs / rank | |||
Normal rank |
Revision as of 12:07, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on stability of graphs |
scientific article |
Statements
A note on stability of graphs (English)
0 references
1984
0 references
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.
0 references
stability index
0 references
stable graphs
0 references
automorphism groups
0 references