# Search results for: Xueliang Li

Arabian Journal of Geosciences > 2019 > 12 > 16 > 1-13

Journal of the American Ceramic Society > 102 > 10 > 5899 - 5909

Acta Geophysica > 2019 > 67 > 5 > 1403-1411

Bulletin of the Malaysian Mathematical Sciences Society > 2019 > 42 > 5 > 2105-2117

*total-coloring*of a graph is a coloring of the edge set and vertex set. A path in a total-colored graph is a

*total proper path*if the coloring of the edges and internal vertices is proper, that is, any two adjacent or incident elements of edges and internal vertices on the path differ in color. For a connected graph

*G*, the

*total proper connection number*of

*G*, denoted by

*tpc*(

*G*), is defined as the...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 268-277

*G*, where

*G*is called the underlying graph of $$G^\sigma $$ G σ . Let $$S(G^\sigma )$$ S ( G σ ) denote the skew-adjacency matrix of $$G^\sigma $$ G σ and $$\alpha (G)$$ α ( G ) be the independence number of

*G*. The rank of $$S(G^\sigma )$$ S ( G...

Macromolecular Rapid Communications > 39 > 23 > n/a - n/a

Biotechnology and Bioengineering > 116 > 1 > 28 - 40

*Clostridium autoethanogenum*as a microbial platform for synthesizing ethanol, 2,3‐butanediol, and other chemicals. Bubble column reactor technology...

Graphs and Combinatorics > 2018 > 34 > 6 > 1553-1563

*G*is

*conflict-free connected*if every two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The

*conflict-free connection number*of a connected graph

*G*, denoted by

*cfc*(

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

*G*conflict-free connected. For a graph

*G*, let

*C*(

*G*) be the subgraph of

*G*induced by its set of cut-edges...

Journal of Combinatorial Optimization > 2018 > 36 > 2 > 458-471

*T*in an edge-colored graph is called a

*proper tree*if no two adjacent edges of

*T*receive the same color. Let

*G*be a connected graph of order

*n*and

*k*be an integer with $$2\le k \le n$$ 2≤k≤n . For $$S\subseteq V(G)$$ S⊆V(G) and $$|S| \ge 2$$ |S|≥2 , an

*S*-

*tree*is a tree containing the vertices of

*S*in

*G*. A set $$\{T_1,T_2,\ldots ,T_\ell \}$$ {T1,T2,…,Tℓ} of

*S*-trees is called

*internally disjoint*...

Macromolecular Rapid Communications > 39 > 9 > n/a - n/a

**Front Cover**: In article number 1700871, Jianbo Tan, Li Zhang, and co‐workers describe a novel enzyme‐catalysis‐induced reversible addition‐fragmentation chain transfer (RAFT)‐mediated dispersion polymerization for preparing AB diblock copolymer nano‐objects with complex morphologies, performed at room temperature. Taking advantage of the oxygen‐tolerant feature of enzyme cascade catalysis, block copolymer...

Macromolecular Rapid Communications > 39 > 9 > n/a - n/a

Journal of Combinatorial Optimization > 2018 > 35 > 4 > 1300-1311

*vertex-monochromatic path*if its internal vertices have the same color. A vertex-coloring of a graph is a

*monochromatic vertex-connection coloring*(

*MVC-coloring*for short), if there is a vertex-monochromatic path joining any two vertices in the graph. For a connected graph

*G*, the

*monochromatic vertex-connection number*, denoted by

*mvc*(

*G*), is defined to be...

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 83-95

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 143-154

Biochemical Engineering Journal > 2018 > 129 > C > 64-73

Applied Mathematics and Computation > 2018 > 317 > C > 234-251

_{0}(ε, m) vertices and at least (α+ɛ)(nr) edges contains a subgraph with m vertices and at least (α+c)(mr) edges, where c=c(α) is positive and does not depend on ε and m. It follows from a theorem of Erdős, Stone and Simonovits that every α ∈ [0, 1) is a jump...