# Search results for: Xueliang Li

International Journal of Multiphase Flow > 2012 > 42 > Complete > 24-28

Discrete Mathematics > 2012 > 312 > 8 > 1453-1457

Graphs and Combinatorics > 2012 > 28 > 2 > 251-263

*G*, where adjacent edges may be colored the same, is called a rainbow path if no two edges of it are colored the same. A nontrivial connected graph

*G*is rainbow connected if for any two vertices of

*G*there is a rainbow path connecting them. The rainbow connection number of

*G*, denoted

*rc*(

*G*), is defined as the smallest number of colors such that

*G*is rainbow connected...

Journal of Combinatorial Optimization > 2012 > 24 > 3 > 389-396

*G*be a nontrivial connected graph of order

*n*and let

*k*be an integer with 2≤

*k*≤

*n*. For a set

*S*of

*k*vertices of

*G*, let

*κ*(

*S*) denote the maximum number

*ℓ*of edge-disjoint trees

*T*

_{1},

*T*

_{2},…,

*T*

_{ ℓ }in

*G*such that

*V*(

*T*

_{ i })∩

*V*(

*T*

_{ j })=

*S*for every pair

*i*,

*j*of distinct integers with 1≤

*i*,

*j*≤

*ℓ*. Chartrand et al. generalized the concept of connectivity as follows: The

*k*-

*connectivity*, denoted by

*κ*

_{ k }(

*G*), of

*G*is...

Computers and Mathematics with Applications > 2011 > 62 > 11 > 4082-4088

Linear Algebra and Its Applications > 2011 > 435 > 10 > 2334-2346

Chemical Engineering Research and Design > 2011 > 89 > 11 > 2298-2308

Linear Algebra and Its Applications > 2011 > 435 > 9 > 2272-2284

International Journal of Multiphase Flow > 2011 > 37 > 7 > 802-811

Linear Algebra and Its Applications > 2011 > 435 > 4 > 804-810

Theoretical Computer Science > 2011 > 412 > 35 > 4531-4535

Advances in Applied Mathematics > 2011 > 47 > 2 > 365-378

European Journal of Combinatorics > 2011 > 32 > 5 > 662-673

Linear Algebra and Its Applications > 2011 > 434 > 5 > 1370-1377

International Journal of Game Theory > 2011 > 40 > 4 > 697-718

Linear Algebra and Its Applications > 2010 > 433 > 11-12 > 1722-1725

Journal of Colloid And Interface Science > 2010 > 352 > 1 > 114-120