| 两类粘合图的 Wiener与 Harary指数 |
| |
| 引用本文： | 邢抱花.两类粘合图的 Wiener与 Harary指数[J].安庆师范学院学报(自然科学版),2015(2):1-3,9. |
| |
| 作者姓名： | 邢抱花 |
| |
| 作者单位： | 安庆师范学院 数学与计算科学学院,安徽 安庆,246133 |
| |
| 基金项目： | 安庆师范学院青年科研基金(KJ201309)。 |
| |
| 摘 要： | 连通图G的Wiener指数是指图G中所有点对的距离之和,Harary指数是指图G中所有点对的距离的倒数之和。本文主要研究了单圈图与双圈图的粘合图以及双圈图与双圈图的粘合图的Wiener指数的下界和Harary指数的上界的问题,并刻画了对应的极值图。
|
| 关 键 词： | 单圈图 双圈图 粘合 Wiener指数 Harary指数 |
Wiener Index and Harary Index of Two Classes Graphs from Identification |
| |
| XING Bao-hua.Wiener Index and Harary Index of Two Classes Graphs from Identification[J].Journal of Anqing Teachers College(Natural Science Edition),2015(2):1-3,9. |
| |
| Authors: | XING Bao-hua |
| |
| Institution: | XING Bao-hua;School of Mathematical & Computational Science,Anqing Teachers College; |
| |
| Abstract: | The Wiener index of a graph G is defined as the sum of distances over all pairs of vertices and the Harary index of a graph G is defined as the sum of reciprocals of distances over all pairs of vertices.In this paper, we give a lower bound for the Wiener index and a upper bound for the Harary index of G , the graph G is constructed by identifying a vertex v1 of a unicyclic graph G 1 and a vertex v2 of a bicyclic graph G 2 , or the graph G is constructed by identifying a vertex v1 of a bicyclic graph G 1 and a vertex v2 of a bicyclic graph G 2 . |
| |
| Keywords: | unicyclic graph bicyclic graph identify Wiener index Harary index |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
