#### Filter Results:

#### Publication Year

1991

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Cornelis Hoede, Xueliang Li
- Discrete Mathematics
- 1994

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.

- Xueliang Li, Shenggui Zhang, Hajo Broersma
- Electronic Notes in Discrete Mathematics
- 2001

- Xueliang Li, Yuefang Sun
- Graphs and Combinatorics
- 2012

- Xueliang Li, Zimao Li, Lusheng Wang
- Journal of Computational Biology
- 2003

In the original paper, Goldman et al. (2000) launched the study of the inverse problems in combinatorial chemistry, which is closely related to the design of combinatorial libraries for drug discovery. Following their ideas, we investigate four other topological indices, i.e., the sigma-index, the c-index, the Z-index, and the M(1)-index, with a special… (More)

- Hajo Broersma, Xueliang Li
- Discussiones Mathematicae Graph Theory
- 1997

Given a graph G = (V, E) and a (not necessarily proper) edge-coloring of G, we consider the complexity of finding a spanning tree of G with as many different colors as possible, and of finding one with as few different colors as possible. We show that the first problem is equivalent to finding a common independent set of maximum cardi-nality in two… (More)

- Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang
- Graphs and Combinatorics
- 2002

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)

- Lin Hu, Xueliang Li
- CJCDGCGT
- 2005

Let G = (V, E) be an (edge-)colored graph, i.e., G is assigned a mapping C : E → {1, 2, · · · , r}, the set of colors. A matching of G is called heterochromatic if its any two edges have different colors. Unlike uncolored matchings for which the maximum matching problem is solvable in polynomial time, the maximum heterochromatic matching problem is… (More)

- Hengzhe Li, Xueliang Li, Sujuan Liu
- Discrete Mathematics
- 2012

- Ligong Wang, Xueliang Li, Cornelis Hoede
- Discrete Mathematics
- 2004

A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to… (More)

- Lin Hu, Xueliang Li
- 2006