Bounds on the Steiner–Wiener index of graphs
-
Published:2021-11-18
Issue:
Volume:
Page:
-
ISSN:1793-8309
-
Container-title:Discrete Mathematics, Algorithms and Applications
-
language:en
-
Short-container-title:Discrete Math. Algorithm. Appl.
Author:
Rasila V. A.1,
Vijayakumar Ambat1
Affiliation:
1. Department of Mathematics, Cochin University of Science and Technology, India
Abstract
Let [Formula: see text] be a set of vertices of a connected graph [Formula: see text]. The Steiner distance of [Formula: see text] is the minimum size among all connected subgraphs of [Formula: see text] containing the vertices of [Formula: see text]. The sum of all Steiner distances on sets of size [Formula: see text] is called the Steiner [Formula: see text]-Wiener index. We obtain formulae for bounds on the Steiner–Wiener index of graphs in terms of chromatic number, vertex connectivity and independence number. Also, we obtain bounds for 4-cycle free graphs.
Funder
Kerala State Council for Science, Technology and Environment
Publisher
World Scientific Pub Co Pte Ltd
Subject
Discrete Mathematics and Combinatorics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献