References
- T. Akutsu, D. Fukagawab, M.M. Halldórsson, A. Takasu, and K. Tanakae, Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees, Theoret. Comput. Sci. 470 (2013), pp. 10–22. doi: 10.1016/j.tcs.2012.11.017
- M. Axenovich and G. Osang, Unavoidable subtrees, Discrete Math. 313 (2013), pp. 924–930. doi: 10.1016/j.disc.2013.01.015
- G.S. Bloom, A characterization of graphs of diameter two, Amer. Math. Monthly 95(1) (1988), pp. 37–38. doi: 10.2307/2323444
- J. Bondy and U.S.R. Murty, Graph Theory with Application, North–Holland, New York, 1976.
- M. Christou, M. Crochemore, T. Flouri, C.S. Iliopoulos, J. Janousek, B. Melichar, and S.P. Pissis, Computing all subtree repeats in ordered trees, Inform. Process. Lett. 112 (2012), pp. 958–962. doi: 10.1016/j.ipl.2012.09.001
- R.C. Entringer, D.E. Jackson, and D.A. Snyder, Distance in graph, Czechoslovak Math. J. 26(101) (1976), pp. 283–296.
- T. Evans and D. Smith, Optimally reliable graphs for both edge and vertex failures, Networks 16 (1986), pp. 199–204. doi: 10.1002/net.3230160208
- I. Gutman and S.J. Cyvin, Kekulé Structures in Benzenoid Hydrocarbons, Springer, Berlin, 1988.
- J. Haslegrave, Extremal results on average subtree density of series-reduced trees, Combin. Theory Ser. B 107 (2014), pp. 26–41. doi: 10.1016/j.jctb.2014.02.003
- F. Jelen and E. Triesch, Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125(2–3) (2003), pp. 225–233. doi: 10.1016/S0166-218X(02)00195-6
- R. Kirk and H. Wang, Largest number of subtrees of trees with a given maximum degree, SIAM J. Discrete Math. 22 (2008), pp. 958–995. doi: 10.1137/070687736
- D.M. Martin and B.D. Thatte, The maximum agreement subtree problem, Discrete Appl. Math. 161 (2013),pp. 1805–1817. doi: 10.1016/j.dam.2013.02.037
- D.H. Smith, Optimally reliable graphs for both edge and vertex failures, Combin. Probab. Comput. 2 (1993), pp.93–100. doi: 10.1017/S0963548300000493
- L.A. Székely and H. Wang, Binary trees with the largest number of subtrees with at least one leaf, 36th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congr. Numer. 177 (2005), pp. 147–169.
- L.A. Székely and H. Wang, On subtrees of trees, Adv. Appl. Math. 34 (2005), pp. 138–155. doi: 10.1016/j.aam.2004.07.002
- L.A. Székely and H. Wang, Binary trees with the largest number of subtrees, Discrete Appl. Math. 155 (2007),pp. 374–385. doi: 10.1016/j.dam.2006.05.008
- L.A. Székely and H. Wang, Extremal values of ratios: Distance problems vs. subtree problems in trees II, Discrete Math. 322 (2014), pp. 36–47. doi: 10.1016/j.disc.2013.12.027
- H. Wang, Some results on trees, PhD thesis, Department of Mathematics, University of South Carolina, 2005.
- W.G. Yan and Y.-N. Yeh, Enumeration of subtrees of trees, Theoret. Comput. Sci. 369 (2006), pp. 256–268. doi: 10.1016/j.tcs.2006.09.002
- X.M. Zhang, X.D. Zhang, D. Gray, and H. Wang, The number of subtrees of trees with given degree sequence, J. Graph Theory 73 (2013), pp. 280–295. doi: 10.1002/jgt.21674
- X.M. Zhang, X.D. Zhang, D. Gray, and H. Wang, Trees with the most subtrees-an algorithmic approach, J. Combin. 3 (2012), pp. 207–223. doi: 10.4310/JOC.2012.v3.n2.a5
- H.X. Zhao, Research on subgraph polynomials and reliability of networks, Ph.D. thesis, School of Computer, Northwestern Polytechnical University, Xi'an, China, 2004.