共 50 条
Steiner Wiener index of Line graphs
被引:3
|作者:
Rasila, V. A.
[1
]
Vijayakumar, Ambat
[1
]
机构:
[1] Cochin Univ Sci & Technol, Dept Math, Cochin, Kerala, India
来源:
关键词:
Distance in graphs;
Steiner distance;
Wiener index;
k-Steiner Wiener index;
Line graphs;
Steiner Gutman index;
DISTANCE;
D O I:
10.1007/s13226-021-00199-1
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let S be a set of vertices of a connected graph G. The Steiner distance of S is the minimum size among all connected subgraphs whose vertex sets contain S. The sum of all Steiner distances on sets of size k is called the Steiner k-Wiener index. We study inequalities on Steiner Wiener index of line graphs. Also we study relations among Steiner Wiener index of line graphs, Steiner edge Wiener index and Steiner Gutman index.
引用
收藏
页码:932 / 938
页数:7
相关论文