The SCEAS System
| |||||||

## Search the dblp DataBase
Sanming Zhou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sanming Zhou
**Almost Covers Of 2-Arc Transitive Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2004, v:24, n:4, pp:731-745 [Journal] - Cai Heng Li, Cheryl E. Praeger, Akshay Venkatesh, Sanming Zhou
**Finite locally-quasiprimitive graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:246, n:1-3, pp:197-218 [Journal] - Man-Keung Siu, Zhongfu Zhang, Sanming Zhou
**An inequality between the diameter and the inverse dual degree of a tree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:259, n:1-3, pp:351-358 [Journal] - Sanming Zhou
**Imprimitive symmetric graphs, 3-arc graphs and 1-designs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:244, n:1-3, pp:521-537 [Journal] - Gerard J. Chang, Changhong Lu, Sanming Zhou
**No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:14, pp:1808-1817 [Journal] - Sanming Zhou
**Constructing a Class of Symmetric Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2002, v:23, n:6, pp:741-760 [Journal] - Cai Heng Li, Sanming Zhou
**On Isomorphisms of Minimal Cayley Graphs and Digraphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2001, v:17, n:2, pp:307-314 [Journal] - Mohammad A. Iranmanesh, Cheryl E. Praeger, Sanming Zhou
**Finite symmetric graphs with two-arc transitive quotients.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:79-99 [Journal] - Jinjiang Yuan, Sanming Zhou
**Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.**[Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2004, v:5, n:2, pp:193-200 [Journal] - Ladislav Stacho, Jozef Sirán, Sanming Zhou
**Routing balanced communications on hamilton decomposable networks.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 2004, v:14, n:3-4, pp:377-385 [Journal] - Sheng Bau, Nicholas C. Wormald, Sanming Zhou
**Decycling numbers of random regular graphs.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:397-413 [Journal] - Sanming Zhou
**Labelling Cayley Graphs on Abelian Groups.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:19, n:4, pp:985-1003 [Journal] - Sanming Zhou
**Bounding the bandwidths for graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:249, n:2, pp:357-368 [Journal] - Sanming Zhou
**A channel assignment problem for optical networks modelled by Cayley graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:310, n:1-3, pp:501-511 [Journal] - Jian Ying Zhang, Zhi-Qiang Liu, Sanming Zhou
**Dynamic domination in fuzzy causal networks.**[Citation Graph (0, 0)][DBLP] IEEE T. Fuzzy Systems, 2006, v:14, n:1, pp:42-57 [Journal] - Sanming Zhou, Zhi-Qiang Liu, Jian Ying Zhang
**Fuzzy causal networks: general model, inference, and convergence.**[Citation Graph (0, 0)][DBLP] IEEE T. Fuzzy Systems, 2006, v:14, n:3, pp:412-420 [Journal] - Beifang Chen, Sanming Zhou
**Domination number and neighbourhood conditions.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:195, n:1-3, pp:81-91 [Journal] - Sanming Zhou
**A sequential coloring algorithm for finite sets.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:199, n:1-3, pp:291-297 [Journal] - Sanming Zhou, Jinjiang Yuan
**Harper-type lower bounds and the bandwidths of the compositions of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:181, n:1-3, pp:255-266 [Journal] - Sanming Zhou
**Interpolation theorems for graphs, hypergraphs and matroids.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:185, n:1-3, pp:221-229 [Journal] - Beifang Chen, Sanming Zhou
**Upper bounds for f-domination number of graphs**[Citation Graph (0, 0)][DBLP]^{, }. Discrete Mathematics, 1998, v:185, n:1-3, pp:239-243 [Journal] - Sanming Zhou
**Matroid tree graphs and interpolation theorems.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:137, n:1-3, pp:395-397 [Journal] **Almost covers of 2-arc transitive graphs.**[Citation Graph (, )][DBLP]**A distance-labelling problem for hypercubes.**[Citation Graph (, )][DBLP]**Distance-two labellings of Hamming graphs.**[Citation Graph (, )][DBLP]**Optimal radio labellings of complete m-ary trees.**[Citation Graph (, )][DBLP]**Large forbidden trade volumes and edge packings of random graphs.**[Citation Graph (, )][DBLP]**Classification of a family of symmetric graphs with complete 2-arc-transitive quotients.**[Citation Graph (, )][DBLP]**Diameter and connectivity of 3-arc graphs.**[Citation Graph (, )][DBLP]**On a class of finite symmetric graphs.**[Citation Graph (, )][DBLP]**Imprimitive symmetric graphs with cyclic blocks.**[Citation Graph (, )][DBLP]**The L(h, 1, 1)-labelling problem for trees.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |