摘要
一个图G的边平均Wiener指标定义为W'e(G)=∑{f,g}■E(G)D'(f,g),其中D'(f,g)是两条边f和g的平均距离。研究了单圈图的边平均Wiener指标,刻画了顶点数n>10的单圈图中具有次大边平均Wiener指标的图的特征。
The edge average Wiener index of a graph G, is defined as W'e (G) D'(f,g) where D' (f,g) is the average distance between two edges f and g. The paper studied the edge average Wiener indices of unicyclic graphs, and characterized all the unicyclic graphs of order n 〉 10 with the second largest edge average Wiener indices.
出处
《陕西理工学院学报(自然科学版)》
2013年第5期75-78,共4页
Journal of Shananxi University of Technology:Natural Science Edition
关键词
边平均Wiener指标
单圈图
圈数
edge average Wiener index
unicyclic graph
cyclomatic number