Abstract
Let PK(n) and cK(n) denote the average values of the k-packing and k-covering numbers of the (n-1)! recursive trees with n nodes. We show that the limits of pK(n)/n and cK(n)/n as n → ∞ exist and we discuss the problem of evaluating these limits.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Meir and J.W. Moon, The expected node-independence number of random trees. Proc. Kon. Ned. Akad. v. Wetensch. 76 (1973) 335–341.
A. Meir and J.W. Moon, The expected node-independence number of various types of trees. Recent Advances in Graph Theory, Academia Praha (1975) 351–363.
A. Meir and J.W. Moon, Relations between packing and covering numbers of a tree. Pac. J. Math. 61 (1975) 225–233.
A. Meir and J.W. Moon, Packing and covering constants for certain families of trees, I. Journal of Graph Theory (to appear).
A. Meir and J.W. Moon, Packing and covering constants for certain families of trees, II. (submitted for publication).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meir, A., Moon, J.W. (1978). Packing and covering constants for recursive trees. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070397
Download citation
DOI: https://doi.org/10.1007/BFb0070397
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08666-6
Online ISBN: 978-3-540-35912-8
eBook Packages: Springer Book Archive