| 一类三圈图的Wiener指数 |
| |
| 引用本文： | 万花,任海珍.一类三圈图的Wiener指数[J].数学研究,2012,45(2):207-212. |
| |
| 作者姓名： | 万花 任海珍 |
| |
| 作者单位： | 青海师范大学数学系,青海西宁,810008 |
| |
| 基金项目： | 国家自然科学基金项目，青海省自然科学基金项目 |
| |
| 摘 要： | 图G的Wiener指数是指图G中所有顶点对间的距离之和,即W（G）=∑dc（u,u）,{u,u}CG其中de（u,u）表示G中顶点u,u之间的距离.三圈图是指边数与顶点数之差等于2的连通图,任意两个圈至多只有一个公共点的三圈图记为T_n~3.研究了三圈图T_n~3的Wiener指数,给出了其具有最小、次小Wiener指数的图结构.
|
| 关 键 词： | 三圈图 Wiener指数 距离 |
The Wiener Index of a Class of Tricyclic Graphs |
| |
| Wan Hua Ren Haizhen.The Wiener Index of a Class of Tricyclic Graphs[J].Journal of Mathematical Study,2012,45(2):207-212. |
| |
| Authors: | Wan Hua Ren Haizhen |
| |
| Institution: | Wan Hua Ren Haizhen (Department of Mathematics,Qinghai Normal University,Xining Qinghai,810008) |
| |
| Abstract: | The Wiener index of the graph G is difined by the sum of distances between all pairs of vertices in G.A tricyclic graph is a connected graph with n vertices and n + 2 edges.In this paper,we study the wiener index of tricyclic graphsτ_n~3 which have at most a common vertex between any two circuits,and the smallest,the second-smallest Wiener indices of the tricyclic graphsτ_n~3 are given. |
| |
| Keywords: | Wiener index Tricyclic graph Distance |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
