| * | 2009 |
|---|
| 25 | EE | T. C. Edwin Cheng,
Liying Kang,
Erfang Shan:
A polynomial-time algorithm for the paired-domination problem on permutation graphs.
Discrete Applied Mathematics 157(2): 262-271 (2009) |
| 24 | EE | Erfang Shan,
T. C. Edwin Cheng:
Upper bounds on the upper signed total domination number of graphs.
Discrete Applied Mathematics 157(5): 1098-1103 (2009) |
| 23 | EE | Erfang Shan,
Yanxia Dong,
Yukun Cheng:
The twin domination number in generalized de Bruijn digraphs.
Inf. Process. Lett. 109(15): 856-860 (2009) |
| 2008 |
|---|
| 22 | EE | Guangjun Xu,
Liying Kang,
Erfang Shan,
Hong Yan:
Proof of a conjecture on k-tuple domination in graphs.
Appl. Math. Lett. 21(3): 287-290 (2008) |
| 21 | EE | Erfang Shan,
T. C. Edwin Cheng,
Liying Kang:
An application of the Turán theorem to domination in graphs.
Discrete Applied Mathematics 156(14): 2712-2718 (2008) |
| 20 | EE | Michael A. Henning,
Liying Kang,
Erfang Shan,
Anders Yeo:
On matching and total domination in graphs.
Discrete Mathematics 308(11): 2313-2318 (2008) |
| 19 | EE | Erfang Shan,
T. C. Edwin Cheng:
Remarks on the minus (signed) total domination in graphs.
Discrete Mathematics 308(15): 3373-3380 (2008) |
| 18 | EE | Erfang Shan,
Zuosong Liang,
T. C. Edwin Cheng:
Clique-transversal Number in Cubic Graphs.
Discrete Mathematics & Theoretical Computer Science 10(2): (2008) |
| 2007 |
|---|
| 17 | EE | Zuosong Liang,
Erfang Shan,
T. C. Edwin Cheng:
Clique-Transversal Sets in Cubic Graphs.
ESCAPE 2007: 107-115 |
| 16 | EE | Guangjun Xu,
Erfang Shan,
Liying Kang,
T. C. Edwin Cheng:
The algorithmic complexity of the minus clique-transversal problem.
Applied Mathematics and Computation 189(2): 1410-1418 (2007) |
| 15 | | Erfang Shan,
Liying Kang:
Bondage number in oriented graphs.
Ars Comb. 84: (2007) |
| 14 | EE | Hong Yan,
Xiaoqi Yang,
Erfang Shan:
Upper minus total domination in small-degree regular graphs.
Discrete Mathematics 307(21): 2453-2463 (2007) |
| 13 | EE | Erfang Shan,
T. C. Edwin Cheng,
Liying Kang:
Absorbant of generalized de Bruijn digraphs.
Inf. Process. Lett. 105(1): 6-11 (2007) |
| 12 | EE | Erfang Shan,
Liying Kang,
Michael A. Henning:
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph".
Journal of Graph Theory 54(4): 350-353 (2007) |
| 2006 |
|---|
| 11 | EE | Liying Kang,
Erfang Shan,
Louis Caccetta:
Total minus domination in k-partite graphs.
Discrete Mathematics 306(15): 1771-1775 (2006) |
| 10 | EE | Guangjun Xu,
Liying Kang,
Erfang Shan:
Acyclic domination on bipartite permutation graphs.
Inf. Process. Lett. 99(4): 139-144 (2006) |
| 9 | EE | Guangjun Xu,
Liying Kang,
Erfang Shan,
Min Zhao:
Power domination in block graphs.
Theor. Comput. Sci. 359(1-3): 299-305 (2006) |
| 2005 |
|---|
| 8 | EE | Yaojun Chen,
T. C. Edwin Cheng,
C. T. Ng,
Erfang Shan:
A note on domination and minus domination numbers in cubic graphs.
Appl. Math. Lett. 18(9): 1062-1067 (2005) |
| 2004 |
|---|
| 7 | EE | Erfang Shan,
Chuangyin Dang,
Liying Kang:
A note on Nordhaus-Gaddum inequalities for domination.
Discrete Applied Mathematics 136(1): 83-85 (2004) |
| 6 | EE | Erfang Shan,
Liying Kang:
A note on balance vertices in trees.
Discrete Mathematics 280(1-3): 265-269 (2004) |
| 2003 |
|---|
| 5 | | Erfang Shan,
Moo Young Sohn,
Liying Kang:
Upper bounds on signed 2-independence number of graphs.
Ars Comb. 69: (2003) |
| 4 | EE | Liying Kang,
Hong Qiao,
Erfang Shan,
Ding-Zhu Du:
Lower bounds on the minus domination and k-subdomination numbers.
Theor. Comput. Sci. 296(1): 89-98 (2003) |
| 2002 |
|---|
| 3 | EE | Liying Kang,
Chuangyin Dang,
Mao-cheng Cai,
Erfang Shan:
Upper bounds for the k-subdomination number of graphs.
Discrete Mathematics 247(1-3): 229-234 (2002) |
| 2001 |
|---|
| 2 | EE | Liying Kang,
Hong Qiao,
Erfang Shan,
Ding-Zhu Du:
Lower Bounds on the Minus Domination and k-Subdomination Numbers.
COCOON 2001: 375-383 |
| 2000 |
|---|
| 1 | | Liying Kang,
Erfang Shan:
Lower bounds on dominating functions in graphs.
Ars Comb. 56: (2000) |
