中文摘要：

Wiener指数是指一个连通图中所有顶点之间的距离之和．给定一个连通图G，若存在G中一棵子树T，使得w（G）=W（T），则称T为G的一棵保Wiener指数的树．给出了对于满足下列条件下的某类m＋2k＋1阶联图PmVP2k＋1中均有保Wiener指数的子树：m=t2＋4t＋8/3k3-k2＋4/3k＋1（t≥k2-1/2k）此结果蕴含了先前的一个结论．

英文摘要：

The Wiener index W is the sum of distance between all pairs of vertices of a connected graph. Given a connected graph G if there is a subtree T of G such that W（G） =W（T）, then T is a tree preserving the Wiener index of G . This paper shows that some subtrees preserving the Wiener index in the join graph Pm V P2k＋l of order mq-2k＋1 exist under the following con m=t2＋4t＋8/3k3-k2＋4/3k＋1（t≥k2-1/2k） and the result contains a known conclusion.