13 citations · 16 across the 3 of their papers we have counts for
6 papers · 1 filter
Further hardness results on the generalized connectivity of graphs
Lily Chen, Xueliang Li, Mengmeng Liu +1
The generalized -connectivity of a graph was introduced by Chartrand et al. in 1984, which is a nice generalization of the classical connectivity. Recently, as a na…
The (revised) Szeged index and the Wiener index of a nonbipartite graph
Lily Chen, Xueliang Li, Mengmeng Liu
Hansen et. al. used the computer programm AutoGraphiX to study the differences between the Szeged index and the Wiener index , and between the revised Szeged index $S…
On a relation between the Szeged index and the Wiener index for bipartite graphs
Lily Chen, Xueliang Li, Mengmeng Liu
{\small The Wiener index of a graph is the sum of the distances between all pairs of vertices in the graph. The Szeged index of a graph is defined as $Sz(G)=…
Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
Lily Chen, Xueliang Li, Mengmeng Liu
A vertex-colored graph is rainbow vertex-connected if any pair of distinct vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-con…
The complexity of determining the rainbow vertex-connection of graphs
Lily Chen, Xueliang Li, Yongtang Shi
A vertex-colored graph is {\it rainbow vertex-connected} if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevi…
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
Lily Chen, Xueliang Li, Huishu Lian
An edge-colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of , denoted ,…