# Search results for: Xueliang Li

Ceramics International > 2014 > 40 > 1 Part A > 289-296

_{2}MnSiO

_{4}powders have been synthesized under mild conditions via an ionothermal synthesis method in ionic liquids of 1-ethyl-3-methylimidazolium tetrafluoroborate ([EMIM]BF

_{4}) and 1-butyl-3-methylimidazolium tetrafluoroborate ([BMIM]BF

_{4}), respectively, and then Li

_{2}MnSiO

_{4}/C cathode materials were prepared by solid-state reaction using sucrose...

_{1/3}Co

_{1/3}Mn

_{1/3}O

_{2}nanocrystallites were synthesized by a one-step hydrothermal method, and uniform second particles were formed by a subsequent calcination process. X-ray diffraction results indicate that the as-synthesized material can be indexed by

*α*-NaFeO

_{2}layered structure with

*R-3 m*space group. The results of Rietveld refinements show the

*I*

_{003}/

*I*

_{104}value of the material is 2.032, and the...

Linear Algebra and Its Applications > 2013 > 439 > 10 > 2948-2960

Surface and Interface Analysis > 45 > 13 > 1869 - 1877

^{2+}were investigated. The treated and untreated carbon xerogels (nitrogen‐doped carbon xerogel and carbon xerogel) are mainly microporous with high surface areas (1150.18 and 1201.46 m

^{2}g

^{−1}) based on the analysis of N

_{2}adsorption isotherm. Fourier transform infrared spectroscopy...

Discrete Applied Mathematics > 2013 > 161 > 16-17 > 2527-2531

*G*was introduced by Chartrand et al. (Network 54(2) (2009), 75–81; 55 (2010), 360–367). For the complete graph

*K*

_{n}of order $n\ge 6$, they showed that $r{x}_{3,\ell}\left({K}_{n}\right)=3$ for $\ell =1,2$. Furthermore, they conjectured that for every positive integer $\ell $, there exists a positive integer

*N*such that $r{x}_{3,\ell}\left({K}_{n}\right)=3$ for every integer $n\ge N$. More generally, they conjectured that for every...

Discussiones Mathematicae Graph Theory > 2013 > 33 > 3 > 603-611

Linear Algebra and Its Applications > 2013 > 438 > 11 > 4547-4556

Discussiones Mathematicae Graph Theory > 2013 > 33 > 2 > 307-313

Discrete Mathematics > 2013 > 313 > 6 > 755-759

Journal of Solid State Electrochemistry > 2013 > 17 > 7 > 1991-2000

_{3}V

_{2}(PO

_{4})

_{3}precursors are synthesized by a novel ionothermal method using three kinds of imidazolium-based ionic liquids as both reaction mediums and structure-directing agents at ambient pressure. Nanostructured Li

_{3}V

_{2}(PO

_{4})

_{3}/C cathode materials can be successfully prepared by a subsequent short calcination process. The structures, morphologies, and electrochemical...

Graphs and Combinatorics > 2013 > 29 > 5 > 1235-1247

*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 number of colors that are needed to make

*G*rainbow connected. In this paper we give a Nordhaus–Gaddum-type result for the rainbow connection number. We prove that if

*G*and $${\overline{G}}$$ are both...

Graphs and Combinatorics > 2013 > 29 > 5 > 1471-1475

*G*is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph

*G*, denoted by

*rc*(

*G*), is the smallest number of colors that are needed in order to make

*G*rainbow connected. In this paper, we proved that

*rc*(

*G*) ≤ 3(

*n*+ 1)/5 for all 3-connected graphs.

Graphs and Combinatorics > 2013 > 29 > 6 > 1733-1739

*G*be a connected graph. The notion of rainbow connection number

*rc*(

*G*) of a graph

*G*was introduced by Chartrand et al. (Math Bohem 133:85–98, 2008). Basavaraju et al. (arXiv:1011.0620v1 [math.CO], 2010) proved that for every bridgeless graph

*G*with radius

*r*, $${rc(G)\leq r(r+2)}$$ and the bound is tight. In this paper, we show that for a connected graph

*G*with radius

*r*and center vertex

*u*,...

Graphs and Combinatorics > 2013 > 29 > 1 > 1-38

*k*...

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

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