摘要
Wiener指数是指一个连通图中所有顶点之间的距离之和。给定一个连通图G,若存在G中一棵子树T,使得W(G)=W(T),则称T为G的一棵保Wiener指数的树,本文给出了对于满足特定条件的某类m+2k阶联图中均有保Wiener指数的子树。
The Wiener index W is the sum of distances among 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 we call T a preserving the Wiener index tree of G. In the paper, some subtrees which preserving the Wiener index in some classes of join graph of order m±2k with some specific conditions are given.
出处
《安庆师范学院学报(自然科学版)》
2008年第1期3-5,共3页
Journal of Anqing Teachers College(Natural Science Edition)