[1]Bondy J A, Murty U S R.Graph theory with application[M].New York,1976.
［2]Yan W G,Yeh Y N.Enumeration of subtrees of trees[J].Theoretical Computer Science,2006,369256－268.
［3]Zhao H X.Research on subgraph polynomials and reliability of networks[D].Xi′anNorthwestern Polytechnical University,P R China,2004.
［4]Wang H.Some results on trees,PLd.Thesis, Department of Mathematics,University of South Carolina.
［5]Eentringer R C,Jackson D E.Distance in raph[J].Czechoslovak Math J,1976,26283－296.
［6]Fischermann M,Hoffmann A,Szekely L A,et al.Wiener index versus maximum degree in trees[J].Discrete Appl Math,2002,122单位 1－3)127－137.
［7]Jelen F,Triesch E.Superdominance order and distance of trees with bounded maximum degree[J].Discrete Appl Math,2003,125单位 2/3)225－233.
［8]Székely L A,Wang H.On subtrees of trees[J].Advances in Applied Mathematics, 2005,34单位 1)138-155.
［9]Székely L A,Wang H.Binary trees with the largest number of subtrees[J].Discrete Applied Mathematics,2007,155单位 3)374-385.
［9]李晓军.图的子树与网络可靠性[D].西宁青海师范大学,2010. |
