Xue-Liang Li

Learn More
A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the weight of e. The weight of a cycle is the sum of the weights of its edges. The weighted degree d w (v) of a vertex v is the sum of the weights of the edges incident with v. In this paper, we prove the following result: Suppose G is a 2-connected weighted(More)
No part of this work may be reproduced by print, photocopy or any other means without the permission in writing from the publisher. If more distant views are what you desire, you simply have to go up higher. Preface This thesis is the result of almost five years of research in the field of hamiltonian graph theory between September 1996 and April, 2001.(More)
Let (G, C) be an edge-colored bipartite graph with bipartition (X, Y). A hete-rochromatic matching of G is such a matching in which no two edges have the same color. Let N c (S) denote a maximum color neighborhood of S ⊆ V (G). We show that if |N c (S)| ≥ |S| for all S ⊆ X, then G has a heterochromatic matching with cardinality at least |X| 3. We also(More)
Two-dimensional (2D) material has many advantages including high carrier mobilities and conductivity, high optical transparency, excellent mechanical flexibility, and chemical stability, which made 2D material an ideal material for various optoelectronic devices. Here, we developed a facile method of preparing MoS2 nanosheets followed by a facile liquid(More)
This study aimed to identify gene expression profile in the rat brain resulting from acute alcohol intoxication (AAI). Eighteen SD rats were divided into the alcohol-treated group (n = 9) and saline control group (n = 9). Periorbital blood samples were taken to determine their blood alcohol content by gas chromatography. Tissue sections were analyzed by H(More)
Let G be an undirected and loopless finite graph that is not a path. The minimum m such that the iterated line graph L m (G) is hamiltonian is called the hamiltonian index of G, denoted by h(G). A reduction method to determine the hamiltonian index of a graph G with h(G) ≥ 2 is given here. With it we will establish a sharp lower bound and a sharp upper(More)
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph → P k (D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k + 1 vertices or form a directed cycle on k(More)
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph → P k (D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k + 1 vertices or form a directed cycle on k(More)
  • 1