# Search results for: Xueliang Li

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

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...