Steiner Wiener index of Line graphs

V. A. Rasila () and Ambat Vijayakumar ()
Additional contact information
V. A. Rasila: Cochin University of Science and Technology
Ambat Vijayakumar: Cochin University of Science and Technology

Indian Journal of Pure and Applied Mathematics, 2022, vol. 53, issue 4, 932-938

Abstract: Abstract 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.

Keywords: Distance in graphs; Steiner distance; Wiener index; k-Steiner Wiener index; Line graphs; Steiner Gutman index; 05C09; 05C12; 05C76 (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-021-00199-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:indpam:v:53:y:2022:i:4:d:10.1007_s13226-021-00199-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-021-00199-1

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().