Communications of the Korean Mathematical Society (대한수학회논문집)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES

  • Published : 2003.01.01
Download PDF
⟨ Previous Next ⟩

Abstract

We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.

Keywords

References

  1. Graphs and Hypergraphs C. Berge
  2. Graphs & Digraphs G. Chartrand;L. Lesniak
  3. Graphical Enumeration F. Harary;E. M. Palmer
  4. Math. Biosci. v.21 Cutting down recursive trees A. Meir;J. W. Moon https://doi.org/10.1016/0025-5564(74)90013-3
  5. Canadian Mathematical Congress Counting Labelled Trees J. W. Moon
  6. Israel J. Math v.3 no.1 On cliques in graphs J. W. Moon;L. Moser https://doi.org/10.1007/BF02760024
  7. Enumerative Combinatorics v.2 R. P. Stanley
  8. SIAM J. Alg. Discrete Methods v.7 The number of maximal independent sets in a tree H. S. Wilf https://doi.org/10.1137/0607015

Cited by

  1. The number of maximal independent sets of (k + 1)-valent trees vol.21, pp.1-2, 2006, https://doi.org/10.1007/BF02896409