| 2008 |
|---|
| 13 | | Guoping Wang,
Qiongxiang Huang,
Jing Cai:
On the spectral radius of graphs with k-vertex cut.
Ars Comb. 89: (2008) |
| 12 | EE | Jianfeng Wang,
Ruying Liu,
Chengfu Ye,
Qiongxiang Huang:
A complete solution to the chromatic equivalence class of graph I.
Discrete Mathematics 308(16): 3607-3623 (2008) |
| 11 | EE | Mingfei Gao,
Qiongxiang Huang:
On generalized theta-graphs whose second largest eigenvalue does not exceed 1.
Discrete Mathematics 308(23): 5849-5855 (2008) |
| 2007 |
|---|
| 10 | | Guoping Wang,
Qiongxiang Huang:
The Edge Choosability of Cn x Pm.
Ars Comb. 83: (2007) |
| 9 | EE | Yongde Feng,
Qiongxiang Huang:
Consecutive edge-coloring of the generalized theta-graph.
Discrete Applied Mathematics 155(17): 2321-2327 (2007) |
| 2005 |
|---|
| 8 | EE | Teng Lv,
Ping Yan,
Qiongxiang Huang:
Relational to XML Schema Conversion with Constraints.
ASIAN 2005: 278-279 |
| 2003 |
|---|
| 7 | EE | Qiongxiang Huang:
A classification of circulant DCI(CI)-digraphs of 2-power order.
Discrete Mathematics 265(1-3): 71-84 (2003) |
| 2001 |
|---|
| 6 | EE | Qiongxiang Huang,
An Chang:
Circulant digraphs determined by their spectra.
Discrete Mathematics 240(1-3): 261-270 (2001) |
| 2000 |
|---|
| 5 | EE | Qiongxiang Huang,
Jixiang Meng:
A Classification of DCI(CI)-Subsets for Cyclic Group of Odd Prime Power Order.
J. Comb. Theory, Ser. B 78(1): 24-34 (2000) |
| 1998 |
|---|
| 4 | EE | Jixiang Meng,
Qiongxiang Huang:
Almost all Cayley graphs have diameter 2.
Discrete Mathematics 178(1-3): 267-269 (1998) |
| 1997 |
|---|
| 3 | EE | Huaxiao Zhang,
Fuji Zhang,
Qiongxiang Huang:
On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs.
Discrete Applied Mathematics 73(1): 59-67 (1997) |
| 2 | EE | Jixiang Meng,
Qiongxiang Huang:
The Automorphism Groups of Minimal Infinite Circulant Digraphs.
Eur. J. Comb. 18(4): 425-429 (1997) |
| 1996 |
|---|
| 1 | | Qiongxiang Huang,
Jinjiang Yuan:
The automorphism groups of circulant digraphs of degree 3.
Ars Comb. 44: (1996) |
