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 2011Show all

3 papers · 1 filter

math.CO2011

Rainbow connection number of dense graphs

Xueliang Li, Mengmeng Liu, Ingo Schiermeyer

An edge-colored graph $G$ 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 $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…