共 50 条
The average Steiner 3-eccentricity of block graphs
被引:3
|作者:
Li, Xingfu
[1
]
Yu, Guihai
[1
]
机构:
[1] Guizhou Univ Finance & Econ, Coll Big Data Stat, Guiyang 550025, Guizhou, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Block order sequence;
Block graphs;
Average Steiner eccentricity;
WIENER INDEX;
UPPER-BOUNDS;
ECCENTRICITY;
DISTANCE;
TREES;
D O I:
10.1007/s12190-020-01473-x
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this work, we study the average Steiner 3-eccentricity on block graphs with a fixed block order sequence. Two graph transformations are present on block graphs. Relying on the transformations, we establish both the lower bound and the upper bound for the average Steiner 3-eccentricity on block graphs with a fixed block order sequence. Finally, we devise an O(n(2)) algorithm to calculate the average Steiner 3-eccentricity on block graphes where n is the order of the graph.
引用
收藏
页码:89 / 100
页数:12
相关论文