21 citations · 90 across the 39 of their papers we have counts for
6 papers · 1 filter
Steiner Distance in Graphs--A Survey
Yaping Mao
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…
Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs
Hong Chang, Zhong Huang, Xueliang Li +2
An edge-colored graph is \emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The…
Conflict-free vertex-connections of graphs
Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2
A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…
Conflict-free connection numbers of line graphs
Bo Deng, Wenjing Li, Xueliang Li +2
A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph is \emph{conflict-free…
The Steiner (n-3)-diameter of a graph
Yaping Mao, Christopher Melekian, Eddie Cheng
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…
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…