13 citations · 22 across the 7 of their papers we have counts for
7 papers
Tricyclic graphs with maximal revised Szeged index
Lily Chen, Xueliang Li, Mengmeng Liu
The revised Szeged index of a graph is defined as where and are, respectively, the number of…
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)=…
Rainbow connection number of dense graphs
Xueliang Li, Mengmeng Liu, Ingo Schiermeyer
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 a connected graph …
Bicyclic graphs with maximal revised Szeged index
Xueliang Li, Mengmeng Liu
The revised Szeged index is defined as where and are, respectively, the number of verti…