17 citations · 53 across the 25 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Steiner diameter, maximum degree and size of a graph
Yaping Mao, Zhao Wang
The Steiner diameter of a graph , introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical diameter. When…
math.CO2017★ 17 cited
Steiner Distance in Product Networks
Yaping Mao, Eddie Cheng, Zhao Wang
For a connected graph of order at least and , the \emph{Steiner distance} among the vertices of is the minimum size among all connected subgra…
math.CO2017★ 3 cited
The Steiner 4-diameter of a graph
Zhao Wang, Yaping Mao, Hengzhe Li +1
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected…