#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2005

2018

- This year (3)
- Last 5 years (14)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sean Turner, Lily Chen
- RFC
- 2011

This document updates the security considerations for the MD5 message digest algorithm. It also updates the security considerations for HMAC-MD5. (IETF). It represents the consensus of the IETFâ€¦ (More)

- Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao
- J. Comb. Optim.
- 2017

The generalized k-connectivity Îºk(G) of a graphG was introduced byChartrand et al. in (Bull Bombay Math Colloq 2:1â€“6, 1984), which is a nice generalization of the classical connectivity. Recently, asâ€¦ (More)

- Lily Chen, Xueliang Li, Mengmeng Liu
- Eur. J. Comb.
- 2014

Hansen et al. used the computer program AutoGraphiX to study the differences between the Szeged index Sz(G) and the Wiener indexW (G), and between the revised Szeged index Sz(G) and the Wiener indexâ€¦ (More)

- Lily Chen, Bofeng Huo, Yingbin Ma
- Discussiones Mathematicae Graph Theory
- 2016

- Lily Chen, Xueliang Li, Mengmeng Liu
- Discrete Applied Mathematics
- 2014

e=uvâˆˆE(nu(e)+n0(e)/2)(nv(e)+n0(e)/2), where nu(e) and nv(e) are, respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer toâ€¦ (More)

- Lily Chen, Xueliang Li, Yongtang Shi
- Theor. Comput. Sci.
- 2011

A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. Theâ€¦ (More)

- Tim Polk, Lily Chen, Sean Turner, Paul E. Hoffman
- RFC
- 2011

- Haidar Chamas, William Bjorkman, Stephen Liu, Lily Chen, Mohamed A. Ali
- IEEE Communications Magazine
- 2005

This article presents Verizon's experience with deploying metro Ethernet services and some of our laboratory activities related to the convergence of layer 2/1 networks. Such convergence leveragesâ€¦ (More)

- Lily Chen, Xueliang Li, Huishu Lian
- Graphs and Combinatorics
- 2013

An edge-colored graph G is rainbow connected if every two vertices of G are connected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the minimumâ€¦ (More)

- Lily Chen, Xueliang Li, Kang Yang, Yan Zhao
- Discussiones Mathematicae Graph Theory
- 2015

Let G be a nontrivial connected graph with an edge-coloring c : E(G) â†’ {1, 2, . . . , q}, q âˆˆ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of Tâ€¦ (More)