The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sanming Zhou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sanming Zhou
    Almost Covers Of 2-Arc Transitive Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:4, pp:731-745 [Journal]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Sanming Zhou
    Bounding the bandwidths for graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:249, n:2, pp:357-368 [Journal]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]

  23. Almost covers of 2-arc transitive graphs. [Citation Graph (, )][DBLP]


  24. A distance-labelling problem for hypercubes. [Citation Graph (, )][DBLP]


  25. Distance-two labellings of Hamming graphs. [Citation Graph (, )][DBLP]


  26. Optimal radio labellings of complete m-ary trees. [Citation Graph (, )][DBLP]


  27. Large forbidden trade volumes and edge packings of random graphs. [Citation Graph (, )][DBLP]


  28. Classification of a family of symmetric graphs with complete 2-arc-transitive quotients. [Citation Graph (, )][DBLP]


  29. Diameter and connectivity of 3-arc graphs. [Citation Graph (, )][DBLP]


  30. On a class of finite symmetric graphs. [Citation Graph (, )][DBLP]


  31. Imprimitive symmetric graphs with cyclic blocks. [Citation Graph (, )][DBLP]


  32. The L(h, 1, 1)-labelling problem for trees. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002