| 含k个顶点度为n-1的简单连通图的调和指标 |
| |
| 引用本文： | 吕剑波.含k个顶点度为n-1的简单连通图的调和指标[J].漳州师院学报,2013(3):8-11. |
| |
| 作者姓名： | 吕剑波 |
| |
| 作者单位： | 闽南师范大学数学与统计学院,福建漳州363000 |
| |
| 基金项目： | 闽南师范大学研究生科研立项资助项目（1300-1314） |
| |
| 摘 要： | 图G的调和指标H（G）定义为所有边uv所对应的d（u）＋2 d（v）之和，其中d（u）为顶点u在G中的度。本文给出了含k个顶点度为n？1的简单连通图的调和指标的极小值并完全刻画了相应的极图。
|
| 关 键 词： | O157 5 文献标识码 A |
The Harmonic Index of Simple Connected Graphs with k Vertices of Degree n-1 |
| |
| LV Jian-bo.The Harmonic Index of Simple Connected Graphs with k Vertices of Degree n-1[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2013(3):8-11. |
| |
| Authors: | LV Jian-bo |
| |
| Institution: | LV Jian-bo (College of Mathematics and Statistics, Minnan Normal University, Zhangzhou, FuJian 363000, China) |
| |
| Abstract: | The harmonic index H（G） of a graph G is the sum of d（u）＋d（v） 2 over all edges uv of G , where d（u） denotes the degree of the vertex u in G . In this paper, we present the minimum values of the harmonic index for the graphs with k vertices of degree n？1 , and characterize the corresponding extremal graph. |
| |
| Keywords: | harmonic index minimum values extremal graph |
| 本文献已被 维普 等数据库收录！ |
