21 citations · 72 across the 15 of their papers we have counts for
19 papers
Steiner (revised) Szeged index of graphs
Modjtaba Ghorbani, Xueliang Li, Hamid Reza Maimani +3
The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph of order…
Ramsey and Gallai-Ramsey number for wheels
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…
On the -good-neighbor connectivity of graphs
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh +1
Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network . In 1996, Fàbrega and Fiol proposed the -good-neighbor conn…
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…