| 多扇图中保Wiener指数的树 |
| |
| 引用本文： | 王力工,樊稳茹,张政.多扇图中保Wiener指数的树[J].湖南师范大学自然科学学报,2012,35(1):17-20. |
| |
| 作者姓名： | 王力工 樊稳茹 张政 |
| |
| 作者单位： | 1. 西北工业大学应用数学系,中国西安,710072
2. 西北工业大学应用数学系,中国西安710072;西安航空技术高等专科学校基础部,中国西安710077 |
| |
| 基金项目： | 国家自然科学基金资助项目，陕西省自然科学基础研究计划资助项目 |
| |
| 摘 要： | Wiener指数W(G)是指一个连通图G中所有顶点之间的距离之和.给定一个连通图G,若存在图G中一个子树T,使得W(G)=W(T),则称T为G的一个保Wiener指数的树.给出了对于满足特定条件的多扇图中具有保Wiener指数的子树,并证明了在多扇图中存在无穷多个这样的子树.
|
| 关 键 词： | Wiener指数 多扇图 树 距离 |
Trees Preserving Wiener Index in Multi-Fan Graphs |
| |
| WANG Li-gong
,
FAN Wen-ru
,
ZHANG Zheng.Trees Preserving Wiener Index in Multi-Fan Graphs[J].Journal of Natural Science of Hunan Normal University,2012,35(1):17-20. |
| |
| Authors: | WANG Li-gong FAN Wen-ru ZHANG Zheng |
| |
| Institution: | 1,2(1.Department of Applied Mathematics,Northwestern Polytechnical University,Xi’an 710072,China; 2.Department of Basic Courses,Xi’an Aerotechnical College,Xi’an 710077,China) |
| |
| Abstract: | The Wiener index W(G) of a connected graph G is the sum of distances among all pairs of vertices of G.Given a connected graph G,if there is a connected subtree T of G such that W(G)=W(T),then T is called a preserve the Wiener index tree of G.Some subtrees which preserve the Wiener index of multi-fan graphs with some specific conditions are given.It is also proved that there exist infinitely many such subtrees in multi-fan graphs. |
| |
| Keywords: | Wiener index multi-fan graphs tree distance |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
