On the expected number of edges in a maximum matching of an (r,s)-tree

References

• Austin , T. L. 1960 . The enumeration of point labelled chromatic graphs and trees . Canad. J. Math. , 12 : 535 – 545 .
   Google Scholar
• Bender , E. A. 1974 . Asymptotic methods in enumeration . SIAM Rev. , 16 : 485 – 515 .
   Web of Science ®Google Scholar
• Moon , J. W. 1970 . Counting Labelled Trees . Canad. Math. Congress . 1970 , Montreal.
   Google Scholar
• Meir , A. and Moon , J. W. 1973 . The expected node-independence number of random trees . Nederl. Akad. Wetensch. Proc. Ser. A , 35 335 – 341 . 76 = Indag. Math.
   Google Scholar
• Meir , A. and Moon , J. W. 1975 . “ The expected node-independence number of various types of trees ” . In Recent Advances in Graph Theory , 351 – 363 . Academia Praha .
   Google Scholar
• Palmer , E. M. 1992 . Matchings in random superpositions of bipartite trees . J. Comput. Appl. Math. , 41
   Google Scholar
• Schmutz , E. 1994 . Matchings in Superpositions of (n, n)-Bipartite Trees . J. Random Structures & Algorithms , 5 : 235 – 241 .
   Google Scholar
• Scoins , H. I. 1962 . The number of trees with nodes of alternate parity . Math. Proc. Cambridge Philos. Soc. , 58 : 12 – 16 .
   Google Scholar