Skip to main content

The number and stability indices of Cn-trees

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

Abstract

A Cn-tree is either the n-point cycle Cn or a graph obtained by identifying a line of Cn with a line of a Cn-tree. Cn-trees are enumerated and, for n>3, their stability indices are found.

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. L.W. Beineke and R.E. Pippert, The number of labeled k-dimensional trees, J. Comb. Th. 6 (1969), 200–5.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. F. Harary and R.Z. Norman, The dissimilarity characteristic of Husimi trees, Annals of Maths., 58 (1953), 134–141.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. F. Harary and E.M. Palmer, Graphical Enumeration. (Academic Press, 1973.)

    Google Scholar 

  4. F. Harary and E.M. Palmer, On acyclic simplicial complexes, Mathematika, 15 (1968), 115–122.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. F. Harary, E.M. Palmer and R.C. Read, On the cell-growth problem for arbitrary polygons, Discrete Maths, 11 (1975), 371–389.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. P. Heffernan, Trees. M.Sc. Thesis, University of Canterbury, New Zealand, 1972.

    Google Scholar 

  7. E.M. Palmer, Variations of the cell growth problem, Graph Theory and Applications, (eds. Y. Alavi et al.), Lecture Notes in Mathematics, No. 303, Springer-Verlag, 1972.

    Google Scholar 

  8. K.C. Stacey, K.L. McAvaney and J. Sims, The stability index of the product of a path and a tree, this volume

    Google Scholar 

  9. K. Stockmeyer, The charm bracelet problem and its applications, Graphs and Combinatorics, (eds. R.A. Bari and F. Harary), Lecture Notes in Mathematics, No. 406, Springer-Verlag, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1976 Springer-Verlag

About this paper

Cite this paper

McAvaney, K.L. (1976). The number and stability indices of Cn-trees. In: Casse, L.R.A., Wallis, W.D. (eds) Combinatorial Mathematics IV. Lecture Notes in Mathematics, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097376

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08053-4

  • Online ISBN: 978-3-540-37537-1

  • eBook Packages: Springer Book Archive