On the Steiner hyper-Wiener index of a graph

Niko Tratnik

Applied Mathematics and Computation, 2018, vol. 337, issue C, 360-371

Abstract: In this paper, we study the Steiner hyper-Wiener index of a graph, which is obtained from the standard hyper-Wiener index by replacing the classical graph distance with the Steiner distance. It is shown how this index is related to the Steiner Hosoya polynomial, which generalizes similar result for the standard hyper-Wiener index. Next, we show how the Steiner 3-hyper-Wiener index of a modular graph can be expressed by using the classical graph distances. As the main result, a method for computing this index for median graphs is developed. Our method makes computation of the Steiner 3-hyper-Wiener index much more efficient. Finally, the method is used to obtain the closed formulas for the Steiner 3-Wiener index and the Steiner 3-hyper-Wiener index of grid graphs.

Keywords: Steiner distance; Wiener index; Hyper-Wiener index; Hosoya polynomial; Median graph; Partial cube (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318304442
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:337:y:2018:i:c:p:360-371

DOI: 10.1016/j.amc.2018.05.035

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().