| Two-tree的调和指标 |
| |
| 引用本文： | 刘克强.Two-tree的调和指标[J].数学的实践与认识,2020(5):99-103. |
| |
| 作者姓名： | 刘克强 |
| |
| 作者单位： | 青海高等职业技术学院公共教学部 |
| |
| 摘 要： | 图G的调和指标是指图G中所有边uv所对应的2/d(u)+d(v)权和,其中d(u),d(v)分别表示顶点u,v的度数.本文的主要目标是计算出所有的n个顶点的two-tree图中的最小与第二小的调和指标.
|
| 关 键 词： | 调和指标 two-tree 图 |
On The Harmonic Index of Two-tree |
| |
| LIU Ke-qiang.On The Harmonic Index of Two-tree[J].Mathematics in Practice and Theory,2020(5):99-103. |
| |
| Authors: | LIU Ke-qiang |
| |
| Institution: | (Department of Public Education,Qinghai Higher Vocational&Technical Institute,Haidong 810799,China) |
| |
| Abstract: | The harmonic index of a graph G is defined as the sum of weights2/d(u)+d(v) of all edges uv of G,where d(u) and d(v) are respectively the degrees of the vertices u and v in G.The aim of this paper is to compute the first and second minimum of Harmonic index in the class of all n-vertex two-tree graphs. |
| |
| Keywords: | harmonic index two-tree graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
