On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph
In 1989, Chartrand, Oellermann, Tian and Zou introduced the Steiner distance for graphs. This is a natural generalization of the classical graph distance concept. Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics>&l...
Main Authors: | Hongfang Liu, Zhizhang Shen, Chenxu Yang, Kinkar Chandra Das |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/20/3863 |
Similar Items
-
Steiner Wiener index of graph products
by: Yaoping Mao, et al.
Published: (2016-09-01) -
The vertex steiner number of a graph
by: J. JOHN
Published: (2020-06-01) -
Steiner Wiener Index of Certain Windmill Graphs.
by: Herish Omer Abdullah
Published: (2023-10-01) -
Steiner Wiener index and line graphs of trees
by: Matjaž Kovše, et al.
Published: (2022-04-01) -
Nordhaus–Gaddum-Type Results for the Steiner Gutman Index of Graphs
by: Zhao Wang, et al.
Published: (2020-10-01)