Skip to main content
SpringerLink
Log in

The number and stability indices of Cn-trees

  • Conference paper
  • First Online:
Combinatorial Mathematics IV

Part of the book series: Lecture Notes in Mathematics ((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, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • 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

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.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  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.

    Article  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.

    Article  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

  1. Department of Mathematics, Gordon Institute of Technology, Geelong, Victoria

    K. L. McAvaney

Authors
  1. K. L. McAvaney
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Louis R. A. Casse Walter D. Wallis

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

Publish with us

Policies and ethics

Search

Navigation