Steiner Wiener index of block graphs

被引：5

作者：

Kovse, Matjaz ^{[1
]}

Rasila, V. A. ^{[2
]}

Vijayakumar, Ambat ^{[2
]}

机构：

[1] IIT Bhubaneswar, Sch Basic Sci, Bhubaneswar, Odisha, India

[2] Cochin Univ Sci & Technol, Dept Math, Kochi, India

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2020年 / 17卷 / 03期

关键词：

Distance in graphs; Steiner distance; Wiener index; Steiner k-Wiener index; block graphs; poset of block graphs; 05C12; DISTANCE; TREES;

D O I：

10.1016/j.akcej.2019.11.001

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let S be a set of vertices of a connected graph G. The Steiner distance of S is the minimum size of a connected subgraph of G containing all the vertices of S. The Steiner k-Wiener index is the sum of all Steiner distances on sets of k vertices of G. Different simple methods for calculating the Steiner k-Wiener index of block graphs are presented.

引用

页码：833 / 840

页数：8