# Search results for: Xueliang Li

Discrete Applied Mathematics > 2009 > 157 > 4 > 869-873

Linear Algebra and Its Applications > 2007 > 427 > 1 > 87-98

Journal of Mathematical Chemistry > 2007 > 42 > 4 > 775-788

*s*(

*G*) of a graph

*G*is defined as

*s*(

*G*) = max

_{ i,j }|λ

_{ i }− λ

_{ j }|, where the maximum is taken over all pairs of eigenvalues of

*G*. Let

*U*(

*n*,

*k*) denote the set of all unicyclic graphs on

*n*vertices with a maximum matching of cardinality

*k*, and

*U*

^{*}(

*n*,

*k*) the set of triangle-free graphs in

*U*(

*n*,

*k*). In this paper, we determine the graphs with the largest and second largest spectral radius in

*U*

^{*}(

*n*,

*k*),...

Journal of Mathematical Chemistry > 2007 > 42 > 4 > 729-740

*U*(

*k*) be the set of all unicyclic graphs with a perfect matching. Let

*C*

_{ g(G)}be the unique cycle of

*G*with length

*g*(

*G*), and

*M*(

*G*) be a perfect matching of

*G*. Let

*U*

^{0}(

*k*) be the subset of

*U*(

*k*) such that

*g*(

*G*)≡ 0 (mod 4), there are just

*g*/2 independence edges of

*M*(

*G*) in

*C*

_{ g(G)}and there are some...

Applied Mathematics-A Journal of Chinese Universities > 2004 > 19 > 1 > 17-26