# Search results for: Xueliang Li

Quantum Information Processing > 2016 > 15 > 2 > 689-720

*PG*(

*r*, 4) by recursive methods and computer search are discussed. For each even

*n*satisfying $$n\ge 282$$ n ≥ 282 and each odd

*z*satisfying $$z\ge 275$$ z ≥ 275 , a quantum

*n*-cap and a quantum

*z*-cap in $$PG(k-1, 4)$$ P G ( k - 1 , 4 ) with suitable

*k*are constructed, and $$[[n,n-2k,4]]$$ [ [ n , n - 2 k , 4 ] ]...

Journal of Combinatorial Optimization > 2016 > 31 > 1 > 223-238

Bulletin of the Malaysian Mathematical Sciences Society > 2017 > 40 > 4 > 1769-1779

*monochromatically-connecting coloring*(MC-coloring, for short) if there is a monochromatic path joining any two vertices, which was introduced by Caro and Yuster. Let

*mc*(

*G*) denote the maximum number of colors used in an MC-coloring of a graph

*G*. Note that an MC-coloring does not exist if

*G*is not connected, in which case we simply let $$mc(G)=0$$ mc(G)=0...

Bulletin of the Malaysian Mathematical Sciences Society > 2018 > 41 > 1 > 415-425

*vertex-proper path*if any two internal adjacent vertices differ in color. A vertex-colored graph is

*proper vertex*

*k*-

*connected*if any two vertices of the graph are connected by

*k*disjoint vertex-proper paths of the graph. For a

*k*-connected graph

*G*, the

*proper vertex*

*k*-

*connection number*of

*G*, denoted by $$pvc_{k}(G)$$ p v c k ( G ) , is defined as the...

Theoretical Computer Science > 2015 > 607 > P3 > 480-487

Discrete Applied Mathematics > 2015 > 193 > C > 102-109

Complexity > 21 > 1 > 35 - 41

Journal of Combinatorial Optimization > 2017 > 33 > 1 > 275-282

*k*-connectivity $$\kappa _k(G)$$ κ k ( G ) of a graph

*G*was introduced by Chartrand et al. in (Bull Bombay Math Colloq 2:1–6, 1984), which is a nice generalization of the classical connectivity. Recently, as a natural counterpart, Li et al. proposed the concept of generalized edge-connectivity for a graph. In this paper, we consider the computational complexity of the...

Journal of Combinatorial Optimization > 2017 > 33 > 1 > 283-291

*k*-connectivity $$\kappa '_{k}(G)$$ κ k ′ ( G ) of a graph

*G*, introduced by Chartrand in 1984, is a generalization of the cut-version of the classical connectivity. Another generalized connectivity of a graph

*G*, named the generalized

*k*-connectivity $$\kappa _{k}(G)$$ κ k ( G ) , mentioned by Hager in 1985, is a natural generalization of the path-version of...

Applied Mathematics and Computation > 2015 > 266 > Complete > 937-945

_{ij}is the distance of v

_{i}and v

_{j}in G. The spectral radius ρ(G) of the Harary matrix RD(G) has been proposed as a structure-descriptor. In this paper, we characterize...

Journal of Combinatorial Optimization > 2017 > 33 > 1 > 123-131

*monochromatic path*if all the edges on the path are colored with one same color. An edge-coloring of

*G*is a

*monochromatic connection coloring*(MC-coloring, for short) if there is a monochromatic path joining any two vertices in

*G*. For a connected graph

*G*, the

*monochromatic connection number*of

*G*, denoted by

*mc*(

*G*), is defined to be the maximum number of colors...

Colloids and Surfaces A: Physicochemical and Engineering Aspects > 2015 > 474 > C > 101-104

Applied Mathematics and Computation > 2015 > 259 > Complete > 470-479

Discrete Mathematics > 2015 > 338 > 5 > 669-673

Discussiones Mathematicae Graph Theory > 2015 > 35 > 2 > 387-398

Applied Mathematics and Computation > 2015 > 258 > Complete > 155-161

Discrete Applied Mathematics > 2015 > 185 > Complete > 102-112

Materials Chemistry and Physics > 2015 > 155 > Complete > 9-16

_{1/3}Co

_{1/3}Mn

_{1/3}O

_{2}cathode materials successfully. It was found that the LiNi

_{1/3}Co

_{1/3}Mn

_{1/3}O

_{2}polycrystalline particles synthesized by ionothermal method were composed of single crystals, which lie on (003)...