| 2008 |
|---|
| 24 | | Zongtian Wei,
Shenggui Zhang:
Vertex-Neighbor-Integrity of Composition Graphs of Paths.
Ars Comb. 86: (2008) |
| 23 | | Bing Chen,
Shenggui Zhang:
A New s3 Type Condition for Heavy Cycles in Weighted Graphs.
Ars Comb. 87: (2008) |
| 22 | EE | Bing Chen,
Shenggui Zhang,
T. C. Edwin Cheng:
Heavy cycles in k-connected weighted graphs with large weighted degree sums.
Discrete Mathematics 308(20): 4531-4543 (2008) |
| 21 | EE | Yinkui Li,
Shenggui Zhang,
Qilong Zhang:
Vulnerability parameters of split graphs.
Int. J. Comput. Math. 85(1): 19-23 (2008) |
| 20 | EE | Zongtian Wei,
Shenggui Zhang:
Vertex-neighbour-integrity of composition graphs of paths and cycles.
Int. J. Comput. Math. 85(5): 727-733 (2008) |
| 2007 |
|---|
| 19 | EE | Shuying Peng,
Meili Li,
Shenggui Zhang,
T. C. Edwin Cheng:
Some New Structural Properties of Shortest 2-Connected Steiner Networks.
FAW 2007: 317-324 |
| 18 | EE | Bing Chen,
Shenggui Zhang,
T. C. Edwin Cheng:
Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums.
International Conference on Computational Science (3) 2007: 338-346 |
| 17 | EE | Jun Fujisawa,
Liming Xiong,
Kiyoshi Yoshimoto,
Shenggui Zhang:
The upper bound of the number of cycles in a 2-factor of a line graph.
Journal of Graph Theory 55(1): 72-82 (2007) |
| 2006 |
|---|
| 16 | EE | Bing Chen,
Shenggui Zhang:
An implicit degree condition for long cycles in 2-connected graphs.
Appl. Math. Lett. 19(11): 1148-1151 (2006) |
| 15 | EE | Qilong Zhang,
Shenggui Zhang:
Edge vulnerability parameters of split graphs.
Appl. Math. Lett. 19(9): 916-920 (2006) |
| 2005 |
|---|
| 14 | EE | Bing Chen,
Shenggui Zhang,
T. C. Edwin Cheng:
An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs.
CJCDGCGT 2005: 21-29 |
| 13 | EE | Genjiu Xu,
Xueliang Li,
Shenggui Zhang:
The Binding Number of a Digraph.
CJCDGCGT 2005: 221-227 |
| 12 | EE | Yinkui Li,
Shenggui Zhang,
Xueliang Li:
Rupture degree of graphs.
Int. J. Comput. Math. 82(7): 793-803 (2005) |
| 11 | EE | Jun Fujisawa,
Kiyoshi Yoshimoto,
Shenggui Zhang:
Heavy cycles passing through some specified vertices in weighted graphs.
Journal of Graph Theory 49(2): 93-103 (2005) |
| 2004 |
|---|
| 10 | EE | Ligong Wang,
Xueliang Li,
Shenggui Zhang:
Families of integral trees with diameters 4, 6, and 8.
Discrete Applied Mathematics 136(2-3): 349-362 (2004) |
| 9 | EE | Haixing Zhao,
Xueliang Li,
Shenggui Zhang,
Ruying Liu:
On the minimum real roots of the -polynomials and chromatic uniqueness of graphs.
Discrete Mathematics 281(1-3): 277-294 (2004) |
| 8 | EE | Shenggui Zhang,
Bing Chen,
Rongzu Yu:
Heavy cycles in k-connected weighted graphs.
Electronic Notes in Discrete Mathematics 17: 293-296 (2004) |
| 7 | EE | Shenggui Zhang,
Shuying Peng:
Relationships between scattering number and other vulnerability parameters.
Int. J. Comput. Math. 81(3): 291-298 (2004) |
| 2002 |
|---|
| 6 | EE | Shenggui Zhang,
Hajo Broersma,
Xueliang Li,
Ligong Wang:
A Fan Type Condition For Heavy Cycles in Weighted Graphs.
Graphs and Combinatorics 18(1): 193-200 (2002) |
| 5 | EE | Shenggui Zhang,
Xueliang Li,
Xinglou Han:
Computing the Scattering Number of Graphs.
Int. J. Comput. Math. 79(2): 179-187 (2002) |
| 2001 |
|---|
| 4 | EE | Ligong Wang,
Xueliang Li,
Shenggui Zhang:
Some New Families of Integral Trees with Diameters 4 and 6.
Electronic Notes in Discrete Mathematics 8: 119-123 (2001) |
| 3 | EE | Xueliang Li,
Shenggui Zhang,
Hajo Broersma:
Paths and Cycles in Colored Graphs.
Electronic Notes in Discrete Mathematics 8: 128-132 (2001) |
| 2 | EE | Shenggui Zhang,
Ziguo Wang:
Scattering number in graphs.
Networks 37(2): 102-106 (2001) |
| 2000 |
|---|
| 1 | EE | Shenggui Zhang,
Xueliang Li,
Hajo Broersma:
Heavy paths and cycles in weighted graphs.
Discrete Mathematics 223(1-3): 327-336 (2000) |
