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

Showing 2012 · math.COShow all

2 papers · 2 filters

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)=…