# Search results for: Xueliang Li

Journal of Mathematical Analysis and Applications > 2016 > 443 > 2 > 675-687

Journal of Solid State Electrochemistry > 2017 > 21 > 4 > 1101-1109

^{−1}at the pore size of 4.1 nm among as-prepared nitrogen-free materials with different sizes. Meanwhile, the nitrogen doping of mesoporous carbon helps...

Discussiones Mathematicae Graph Theory > 2016 > 36 > 4 > 931-958

Microprocessors and Microsystems > 2016 > 47 > PB > 278-286

Journal of Combinatorial Optimization > 2017 > 34 > 2 > 441-452

*G*is a function $$f:V\rightarrow N$$ f : V → N such that $$f(x)\ne f(y)$$ f ( x ) ≠ f ( y ) for every edge $$xy\in E$$ x y ∈ E . A proper coloring of a graph

*G*such that for every $$k\ge 1$$ k ≥ 1 , the union of any

*k*color classes induces a $$(k-1)$$ ( k - 1 ) -degenerate...

Discrete Applied Mathematics > 2016 > 209 > C > 68-74

Electrochimica Acta > 2016 > 210 > C > 734-742

Bulletin of the Malaysian Mathematical Sciences Society > 2018 > 41 > 4 > 1681-1695

*T*in an edge-colored graph is 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 a fixed integer with $$2\le k\le n$$ 2≤k≤n . For a vertex subset $$S \subseteq V(G)$$ S⊆V(G) with $$\left| S\right| \ge 2$$ S≥2 , a tree containing all the vertices of

*S*in

*G*is called an

*S*-tree. An edge-coloring of

*G*is called a

*k*-

*proper coloring*...

Journal of Combinatorial Optimization > 2017 > 34 > 1 > 165-173

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

*G*proper connected is called the proper connection number of...

Sensors and Actuators B: Chemical > 2016 > 230 > C > 746-752

Journal of Combinatorial Optimization > 2017 > 33 > 4 > 1443-1453

*T*in an edge-colored (vertex-colored) graph

*H*is called a

*monochromatic (vertex-monochromatic) tree*if all the edges (internal vertices) of

*T*have the same color. For $$S\subseteq V(H)$$ S ⊆ V ( H ) , a

*monochromatic (vertex-monochromatic) S-tree*in

*H*is a monochromatic (vertex-monochromatic) tree of

*H*containing the vertices of

*S*. For a connected graph

*G*and a given integer

*k*with...

physica status solidi (a) > 213 > 6 > 1500 - 1504

Linear Algebra and its Applications > 2016 > 497 > C > 199-208

Bulletin of the Malaysian Mathematical Sciences Society > 2018 > 41 > 3 > 1199-1209

*P*in an edge-colored graph

*G*is called a proper path if no two adjacent edges of

*P*are colored the same, and

*G*is proper connected if every two vertices of

*G*are connected by a proper path in

*G*. The proper connection number of a connected graph

*G*, denoted by $$\textit{pc}(G)$$ pc(G) , is the minimum number of colors that are needed to make

*G*proper connected. In this paper, we investigate the...

Discussiones Mathematicae Graph Theory > 2016 > 36 > 2 > 455-465

Linear Algebra and its Applications > 2016 > 496 > C > 475-486

*g*(

*D*) of a digraph

*D*and the minimum outdegree

*δ*

^{ + }(

*D*) of

*D*. The special case when

*g*(

*D*) = 3 has lately attracted wide attention. For an undirected graph

*G*, the binding number $bind(G)\geq \frac 3 2$ is a sufficient condition for

*G*to have a triangle (cycle with length 3). In this paper we generalize the concept...