Search the dblp DataBase

Publications of Author

1. Bing Chen, Shenggui Zhang
   An implicit degree condition for long cycles in 2-connected graphs. [Citation Graph (0, 0)][DBLP]
   Appl. Math. Lett., 2006, v:19, n:11, pp:1148-1151 [Journal]
   
2. Qilong Zhang, Shenggui Zhang
   Edge vulnerability parameters of split graphs. [Citation Graph (0, 0)][DBLP]
   Appl. Math. Lett., 2006, v:19, n:9, pp:916-920 [Journal]
   
3. Ligong Wang, Xueliang Li, Shenggui Zhang
   Families of integral trees with diameters 4, 6, and 8. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:349-362 [Journal]
   
4. Shenggui Zhang, Xueliang Li, Hajo Broersma
   Heavy paths and cycles in weighted graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:223, n:1-3, pp:327-336 [Journal]
   
5. Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu
   On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:281, n:1-3, pp:277-294 [Journal]
   
6. Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang
   A Fan Type Condition For Heavy Cycles in Weighted Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2002, v:18, n:1, pp:193-200 [Journal]
   
7. Yinkui Li, Shenggui Zhang, Xueliang Li
   Rupture degree of graphs. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Math., 2005, v:82, n:7, pp:793-803 [Journal]
   
8. Shenggui Zhang, Shuying Peng
   Relationships between scattering number and other vulnerability parameters. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Math., 2004, v:81, n:3, pp:291-298 [Journal]
   
9. Shenggui Zhang, Xueliang Li, Xinglou Han
   Computing the Scattering Number of Graphs. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Math., 2002, v:79, n:2, pp:179-187 [Journal]
   
10. Shenggui Zhang, Ziguo Wang
    Scattering number in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:102-106 [Journal]
    
11. Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang
    Heavy cycles passing through some specified vertices in weighted graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:2, pp:93-103 [Journal]
    
12. Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
    Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:338-346 [Conf]
    
13. Shuying Peng, Meili Li, Shenggui Zhang, T. C. Edwin Cheng
    Some New Structural Properties of Shortest 2-Connected Steiner Networks. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:317-324 [Conf]
    
14. Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
    An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:21-29 [Conf]
    
15. Genjiu Xu, Xueliang Li, Shenggui Zhang
    The Binding Number of a Digraph. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:221-227 [Conf]
    
16. 
    Vertex-Neighbor-Integrity of Composition Graphs of Paths. [Citation Graph (, )][DBLP]
    
    
17. 
    A New s3 Type Condition for Heavy Cycles in Weighted Graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Heavy cycles in k-connected weighted graphs with large weighted degree sums. [Citation Graph (, )][DBLP]
    
    
19. 
    Hamilton cycles in claw-heavy graphs. [Citation Graph (, )][DBLP]
    
    
20. 
    Degree sum conditions for oriented forests in digraphs. [Citation Graph (, )][DBLP]
    
    
21. 
    Extreme values of the sum of squares of degrees of bipartite graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    On extremal weighted digraphs with no heavy paths. [Citation Graph (, )][DBLP]