Mengmeng Liu

activity

20112013

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

13 citations · 22 across the 7 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013★ 4 cited

Tricyclic graphs with maximal revised Szeged index

Lily Chen, Xueliang Li, Mengmeng Liu

The revised Szeged index of a graph $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…

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…