Lily Chen

activity

20102018

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

13 citations · 26 across the 9 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

3 papers · 2 filters

math.CO2013

The 3-rainbow index of a graph

Lily Chen, Xueliang Li, Kang Yang +1

Let $G$ be a nontrivial connected graph with an edge-coloring $c : E (G) \to {1, 2, ..., q},$ $q \in N$ , where adjacent edges may be colored the same. A tree $T$ in $G…

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…