Hostname: page-component-77c89778f8-gq7q9 Total loading time: 0 Render date: 2024-07-20T03:29:23.505Z Has data issue: false hasContentIssue false
  • English
  • Français

The stability index of a cactus

Published online by Cambridge University Press:  09 April 2009

Douglas D. Grant  and
D. A. Holton
Douglas D. Grant
Affiliation:
Department of Mathematics, University of Reading, England
D. A. Holton
Affiliation:
Department of Mathematics, University of MelbourneParkville 3052, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We show that if G is a connected graph of order n such that no line lies in more than one cycle (in other words, G is a cactus of order n), then the stability index of G is one of the integers 0, 1, n−7, n−6, n−5, n−4 or n.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 24 , Issue 2 , September 1977 , pp. 170 - 183
Copyright
Copyright © Australian Mathematical Society 1977

References

Grant, D. D. (1974), “The stability index of graphs”, Proc. Second Australian Conference on Combinatorial Mathematics, Lecture Notes in Mathematics No. 403 (Springer-Verlag, Berlin), pp. 29–52.CrossRefGoogle Scholar
Harary, F. (1969), Graph Theory (Addison-Wesley, Reading, Mass.).CrossRefGoogle Scholar
Heffernan, P. (1972), Trees (M.Sc. Thesis, University of Canterbury, New Zealand).Google Scholar
Holton, D. A. and Grant, D. D. (1975), “Regular graphs and stability”, J. Austral. Math. Soc. 20, (Ser. A), 377–384.CrossRefGoogle Scholar
McAvaney, K. L. (1975), “Semi-stable and stable cacti”, J. Austral. Math. Soc. 20 (Ser. A), 419–430.CrossRefGoogle Scholar
McAvaney, K. L., Grant, D. D. and Holton, D. A. (1974), “Stable and semi-stable unicyclic graphs”, Discrete Math. 9, 277–288.CrossRefGoogle Scholar
Robertson, N. and Zimmer, J. A. (1972), “Automorphisms of subgroups obtained by deleting a pendant vertex”, J. Combinatorial Theory, Ser. B. 12, 169–173.CrossRefGoogle Scholar