| 2007 |
|---|
| 24 | EE | Gerard J. Chang,
Changhong Lu,
Sanming Zhou:
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.
Discrete Mathematics 307(14): 1808-1817 (2007) |
| 23 | EE | Jinjiang Yuan,
Jian Ying Zhang,
Sanming Zhou:
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem.
J. Discrete Algorithms 5(3): 609-621 (2007) |
| 22 | EE | András Telcs,
Nicholas C. Wormald,
Sanming Zhou:
Hamiltonicity of random graphs produced by 2-processes.
Random Struct. Algorithms 31(4): 450-481 (2007) |
| 2006 |
|---|
| 21 | EE | Jian Ying Zhang,
Zhi-Qiang Liu,
Sanming Zhou:
Dynamic domination in fuzzy causal networks.
IEEE T. Fuzzy Systems 14(1): 42-57 (2006) |
| 20 | EE | Sanming Zhou,
Zhi-Qiang Liu,
Jian Ying Zhang:
Fuzzy causal networks: general model, inference, and convergence.
IEEE T. Fuzzy Systems 14(3): 412-420 (2006) |
| 2005 |
|---|
| 19 | EE | Mohammad A. Iranmanesh,
Cheryl E. Praeger,
Sanming Zhou:
Finite symmetric graphs with two-arc transitive quotients.
J. Comb. Theory, Ser. B 94(1): 79-99 (2005) |
| 18 | EE | Sanming Zhou:
Labelling Cayley Graphs on Abelian Groups.
SIAM J. Discrete Math. 19(4): 985-1003 (2005) |
| 2004 |
|---|
| 17 | EE | Sanming Zhou:
Almost Covers Of 2-Arc Transitive Graphs.
Combinatorica 24(4): 731-745 (2004) |
| 16 | EE | Jinjiang Yuan,
Sanming Zhou:
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.
Journal of Interconnection Networks 5(2): 193-200 (2004) |
| 15 | EE | Ladislav Stacho,
Jozef Sirán,
Sanming Zhou:
Routing balanced communications on hamilton decomposable networks.
Parallel Processing Letters 14(3-4): 377-385 (2004) |
| 14 | EE | Sanming Zhou:
A channel assignment problem for optical networks modelled by Cayley graphs.
Theor. Comput. Sci. 310(1-3): 501-511 (2004) |
| 2002 |
|---|
| 13 | EE | Sanming Zhou:
Imprimitive symmetric graphs, 3-arc graphs and 1-designs.
Discrete Mathematics 244(1-3): 521-537 (2002) |
| 12 | EE | Cai Heng Li,
Cheryl E. Praeger,
Akshay Venkatesh,
Sanming Zhou:
Finite locally-quasiprimitive graphs.
Discrete Mathematics 246(1-3): 197-218 (2002) |
| 11 | EE | Man-Keung Siu,
Zhongfu Zhang,
Sanming Zhou:
An inequality between the diameter and the inverse dual degree of a tree.
Discrete Mathematics 259(1-3): 351-358 (2002) |
| 10 | EE | Sanming Zhou:
Constructing a Class of Symmetric Graphs.
Eur. J. Comb. 23(6): 741-760 (2002) |
| 9 | EE | Sheng Bau,
Nicholas C. Wormald,
Sanming Zhou:
Decycling numbers of random regular graphs.
Random Struct. Algorithms 21(3-4): 397-413 (2002) |
| 2001 |
|---|
| 8 | EE | Cai Heng Li,
Sanming Zhou:
On Isomorphisms of Minimal Cayley Graphs and Digraphs.
Graphs and Combinatorics 17(2): 307-314 (2001) |
| 2000 |
|---|
| 7 | EE | Sanming Zhou:
Bounding the bandwidths for graphs.
Theor. Comput. Sci. 249(2): 357-368 (2000) |
| 1999 |
|---|
| 6 | EE | Beifang Chen,
Sanming Zhou:
Domination number and neighbourhood conditions.
Discrete Mathematics 195(1-3): 81-91 (1999) |
| 5 | EE | Sanming Zhou:
A sequential coloring algorithm for finite sets.
Discrete Mathematics 199(1-3): 291-297 (1999) |
| 1998 |
|---|
| 4 | EE | Sanming Zhou,
Jinjiang Yuan:
Harper-type lower bounds and the bandwidths of the compositions of graphs.
Discrete Mathematics 181(1-3): 255-266 (1998) |
| 3 | EE | Sanming Zhou:
Interpolation theorems for graphs, hypergraphs and matroids.
Discrete Mathematics 185(1-3): 221-229 (1998) |
| 2 | EE | Beifang Chen,
Sanming Zhou:
Upper bounds for f-domination number of graphs, .
Discrete Mathematics 185(1-3): 239-243 (1998) |
| 1995 |
|---|
| 1 | EE | Sanming Zhou:
Matroid tree graphs and interpolation theorems.
Discrete Mathematics 137(1-3): 395-397 (1995) |
