Mengmeng Liu

activity

20112013

most citedNordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

13 citations · 18 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2013★ 1 cited

Further hardness results on the generalized connectivity of graphs

Lily Chen, Xueliang Li, Mengmeng Liu +1

The generalized $k$ -connectivity $κ_{k} (G)$ of a graph $G$ was introduced by Chartrand et al. in 1984, which is a nice generalization of the classical connectivity. Recently, as a na…

math.CO2012

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 $S z (G)$ and the Wiener index $W (G)$ , and between the revised Szeged index $S…

math.CO2012★ 4 cited

On a relation between the Szeged index and the Wiener index for bipartite graphs

Lily Chen, Xueliang Li, Mengmeng Liu

{\small The Wiener index $W (G)$ of a graph $G$ is the sum of the distances between all pairs of vertices in the graph. The Szeged index $S z (G)$ of a graph $G$ is defined as $Sz(G)=…

math.CO2011

Bicyclic graphs with maximal revised Szeged index

Xueliang Li, Mengmeng Liu

The revised Szeged index $S z^{*} (G)$ is defined as $S z^{*} (G) = \sum_{e = uv \in E} (n_{u} (e) + n_{0} (e) /2) (n_{v} (e) + n_{0} (e) /2),$ where $n_{u} (e)$ and $n_{v} (e)$ are, respectively, the number of verti…

math.CO2011★ 13 cited

Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

Lily Chen, Xueliang Li, Mengmeng Liu

A vertex-colored graph $G$ 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…