#### Filter Results:

- Full text PDF available (110)

#### Publication Year

1991

2018

- This year (15)
- Last 5 years (85)
- Last 10 years (153)

#### Publication Type

#### Co-author

#### Journals and Conferences

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.

- Hajo Broersma, Xueliang Li
- Discrete Applied Mathematics
- 1993

In this note we give an explanation for two phenomena mentioned in the concluding remarks of “The matching polynomial of a polygraph” by Babic et al. The following results are obtained: (1) Although… (More)

- Lily Chen, Xueliang Li, Yongtang Shi
- Theor. Comput. Sci.
- 2011

A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The… (More)

- Xueliang Li, Yongtang Shi
- 2007

The general Randić index Rα(G) of a (chemical) graph G, is defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α an arbitrary real… (More)

- Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang
- Australasian J. Combinatorics
- 2001

Let G be an (edge-)colored graph. A path (cycle) is called monochromatic if all of its edges have the same color, and is called heterochromatic if all of its edges have different colors. In this… (More)

- 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… (More)

- Yinkui Li, Shenggui Zhang, Xueliang Li
- Int. J. Comput. Math.
- 2005

We introduce a new graph parameter, the rupture degree. The rupture degree for a complete graph Kn is defined as 1 − n, and the rupture degree for an incomplete connected graph G is defined by r(G) =… (More)

- 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 su3cient and necessary condition for complete r-partite graphs to be integral,… (More)

- Xueliang Li, Yaping Mao, Yuefang Sun
- Australasian J. Combinatorics
- 2014

The generalized k-connectivity κk(G) of a graph G was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized k-edge-connectivity, λk(G). For general k, the… (More)

- Ivan Gutman, Xueliang Li, Yaping Mao
- 2016