Browse > Article
http://dx.doi.org/10.4134/CKMS.2003.18.1.181

THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES  

Lee, Chang-Woo (Department of Mathematics University of Seoul)
Publication Information
Communications of the Korean Mathematical Society / v.18, no.1, 2003 , pp. 181-192 More about this Journal
Abstract
We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.
Keywords
independent dominating set; maximal independent set; rooted labeled tree; ordinary labeled tree; recursive tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 /
[ G. Chartrand;L. Lesniak ] / Graphs & Digraphs
2 /
[ C. Berge ] / Graphs and Hypergraphs
3 Cutting down recursive trees /
[ A. Meir;J. W. Moon ] / Math. Biosci.   DOI   ScienceOn
4 /
[ R. P. Stanley ] / Enumerative Combinatorics
5 /
[ F. Harary;E. M. Palmer ] / Graphical Enumeration
6 Counting Labelled Trees /
[ J. W. Moon ] / Canadian Mathematical Congress
7 On cliques in graphs /
[ J. W. Moon;L. Moser ] / Israel J. Math   DOI
8 The number of maximal independent sets in a tree /
[ H. S. Wilf ] / SIAM J. Alg. Discrete Methods   DOI