Maximizing the number of independent subsets over trees with maximum degree 3
暂无分享,去创建一个
[1] Yaoping Hou. On acyclic systems with minimal Hosoya index , 2002, Discret. Appl. Math..
[2] Helmut Prodinger,et al. Fibonacci Numbers of Graphs III: Planted Plane Trees , 1986 .
[3] Bruce Hedman,et al. Another extremal problem for Turan graphs , 1987, Discret. Math..
[4] Eberhard Triesch,et al. Superdominance order and distance of trees with bounded maximum degree , 2003, Discret. Appl. Math..
[5] Hua Wang,et al. Binary trees with the largest number of subtrees , 2007, Discret. Appl. Math..
[6] Lusheng Wang,et al. The Inverse Problems for Some Topological Indices in Combinatorial Chemistry , 2003, J. Comput. Biol..
[7] I. Gutman,et al. Mathematical Concepts in Organic Chemistry , 1986 .
[8] Helmut Prodinger,et al. Fibonacci Numbers of Graphs: II , 1983, The Fibonacci Quarterly.
[9] Stephan Wagner,et al. Extremal trees with respect to Hosoya Index and Merrifield-Simmons Index. ∗ , 2006 .
[10] N. Trinajstic. Chemical Graph Theory , 1992 .
[11] R. Merrifield,et al. Topological methods in chemistry , 1989 .
[12] László A. Székely,et al. On subtrees of trees , 2005, Adv. Appl. Math..
[13] Dieter Rautenbach,et al. Wiener index versus maximum degree in trees , 2002, Discret. Appl. Math..
[14] I. Gutmana,et al. Extremal Chemical Trees , 2002 .