Steiner Wiener index of block graphs
Matjaž Kovše, V A. Rasila, Ambat Vijayakumar
AKCE International Journal of Graphs and Combinatorics · 2020
doi:10.1016/j.akcej.2019.11.001 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.