Skip to main content

Stability and operations on graphs

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 452)

Abstract

In this paper we give a detailed survey of stability properties of various combinations of graphs.

We review previous work on unions, joins and (cartesian) products of graphs, and supply further evidence of the unpredictability of the stability index function under cartesian products in that we show that for r>2, the r-cube has stability index 1, which for most values of m and n the product Pm × Pn of two paths has stability index mn-7.

Finally, we discuss the stability properties of compositions (lexicographic products) and coronas of graphs, in particular finding infinite families of such graphs which are stable.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Behzad and G. Chartrand, Introduction to the Theory of Graphs (Allyn and Bacon, Boston, 1971).

    MATH  Google Scholar 

  2. D. D. Grant, The stability index of graphs, Combinatorial Mathematics: Proc. Second Australian Conference (D. A. Holton, ed.), Lecture Notes in Mathematics Vol. 403 (1974), to appear, (Springer-Verlag, Berlin-Heidelberg-New York).

    Google Scholar 

  3. F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969).

    MATH  Google Scholar 

  4. P. Heffernan, Trees, M.Sc. Thesis, Univ. of Canterbury (New Zealand) 1972.

    Google Scholar 

  5. D. A. Holton, Two applications of semi-stable graphs, Discrete Math. 4(1973) 151–158.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. D. A. Holton, A report on stable graphs, J. Aust. Math. Soc. 15 (1973), 163–171.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. D. A. Holton, Stable Trees, J. Aust. Math. Soc. 15 (1973), 476–481.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. D. A. Holton, A note on distance-symmetric graphs, submitted.

    Google Scholar 

  9. D. A. Holton and D. D. Grant, Regular graphs and stability, J. Aust. Math. Soc., to appear.

    Google Scholar 

  10. D. A. Holton and D. D. Grant, Products of trees and stability, submitted.

    Google Scholar 

  11. K. L. McAvaney, Stability and enumeration, M.Sc. Thesis, Univ. of Melbourne, 1974.

    Google Scholar 

  12. N. Robertson and J. A. Zimmer, Automorphisms of subgraphs obtained by deleting a pendant vertex, J. Comb. Th. 12B (1972), 169–173.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. G. Sabidussi, The composition of graphs, Duke Math. J. 26(1959), 693–696.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Grant, D.D. (1975). Stability and operations on graphs. In: Street, A.P., Wallis, W.D. (eds) Combinatorial Mathematics III. Lecture Notes in Mathematics, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069551

Download citation

  • DOI: https://doi.org/10.1007/BFb0069551

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07154-9

  • Online ISBN: 978-3-540-37482-4

  • eBook Packages: Springer Book Archive