Maximizing the number of independent subsets over trees with bounded degree

Journal of Graph Theory

Volumn 58, Issue 1, 2008, Pages 49-68

  Heuberger, Clemens ^a   Wagner, Stephan G ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

D ary trees; Digit expansion; Independent sets; Maximum degree

Indexed keywords

BINARY TREES; BRANCH AND BOUND METHOD; CHARACTERIZATION; MATHEMATICAL MORPHOLOGY; THEOREM PROVING;

BINARY SYSTEMS; DIGIT EXPANSION; INDEPENDENT VERTEX SUBSETS;

SET THEORY;

EID: 43349105905     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20294     Document Type: Article

References (21)

1. 1 M. Fischermann, I. Gutman, A. Hoffmann, D. Rautenbach, D. Vidović, and L. Volkmann, Extremal chemical trees, Z. Naturforsch 57a (2002), 49–52.
2. 2 M. Fischermann, A. Hoffmann, D. Rautenbach, L. Székely, and L. Volkmann, Wiener index versus maximum degree in trees, Discrete Appl Math 122 (1–3) (2002), 127–137.
3. 3 I. Gutman and O. E. Polansky, Mathematical concepts in organic chemistry, Springer‐Verlag, Berlin, 1986.
4. 4 B. Hedman, Another extremal problem for Turán graphs, Discrete Math 65 (2) (1987), 173–176.
5. 5 H. Hosoya, Topological index as a common tool for quantum chemistry, statistical mechanics, and graph theory, In: Mathematical and computational concepts in chemistry (Dubrovnik, 1985), Ellis Horwood Ser Math Appl, Horwood, Chichester, 1986, pp. 110–123.
6. 6 Y. Hou, On acyclic systems with minimal Hosoya index, Discrete Appl Math 119 (3) (2002), 251–257.
7. 7 F. Jelen and E. Triesch, Superdominance order and distance of trees with bounded maximum degree, Discrete Appl Math 125 (2–3) (2003), 225–233.
8. 8 P. Kirschenhofer, H. Prodinger, and R. F. Tichy, Fibonacci numbers of graphs. II, Fibonacci Quart 21 (3) (1983), 219–229.
9. 9 P. Kirschenhofer, H. Prodinger, and R. F. Tichy, Fibonacci numbers of graphs. III, Planted plane trees, In: Fibonacci Numbers and Their Applications (Patras, 1984), Vol. 28 of Math Appl, Reidel, Dordrecht, 1986, pp. 105–120.
10. 10 X. Li, Z. Li, and L. Wang, The inverse problems for some topological indices in combinatorial chemistry, J Comput Biol 10 (2003), 47–55.
11. 11 X. Li, H. Zhao, and I. Gutman, On the Merrifield‐Simmons index of trees, MATCH Commun Math Comput Chem 54 (2) (2005), 389–402.
12. 12 S. B. Lin and C. Lin, Trees and forests with large and small independent indices, Chinese J Math 23 (3) (1995), 199–210.
13. 13 R. E. Merrifield and H. E. Simmons, Topological Methods in Chemistry, Wiley, New York, 1989.
14. 14 H. Prodinger and R. F. Tichy, Fibonacci numbers of graphs, Fibonacci Quart 20 (1) (1982), 16–21.
15. 15 B. E. Sagan, A note on independent sets in trees, SIAM J Discrete Math 1 (1) (1988), 105–108.
16. 16 L. A. Székely and H. Wang, On subtrees of trees, Adv in Appl Math 34 (1) (2005), 138–155.
17. 17 L. A. Székely and H. Wang, Binary trees with the largest number of subtrees, Discrete Appl Math 155 (3) (2007), 374–385.
18. 18 R. F. Tichy and S. G. Wagner, Algorithmic generation of molecular graphs with large Merrifield‐Simmons index, MATCH Commun Math Comput Chem 59 (1) (2008), 239–252.
19. 19 N. Trinajstić, Chemical graph theory, CRC Press, Boca Raton, FL, 1992.
20. 20 S. Wagner, Extremal trees with respect to Hosoya Index and Merrifield‐Simmons Index, MATCH Commun Math Comput Chem 57 (1) (2007), 221–233.
21. 21 H. S. Wilf, The number of maximal independent sets in a tree, SIAM J Algebraic Discrete Methods 7 (1) (1986), 125–130.