Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Erfang Shan
2010 – today
- 2013
[j41]- 2012
- [j40]Erfang Shan, Yanxia Dong: The k-tuple twin domination in generalized de Bruijn and Kautz networks. Computers & Mathematics with Applications 63(1): 222-227 (2012)
- [j39]Dingguo Wang, Erfang Shan: The signed maximum-clique transversal number of regular graphs. Int. J. Comput. Math. 89(6): 741-751 (2012)
- [j38]Hechao Wang, Erfang Shan, Wei Wang: On the super connectivity of Kronecker products of graphs. Inf. Process. Lett. 112(10): 402-405 (2012)
- [j37]Shenwei Huang, Erfang Shan, Liying Kang: Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23(4): 507-518 (2012)
- 2011
- [j36]Erfang Shan, Haichao Wang: Claw-free cubic graphs with clique-transversal number half of their order. Appl. Math. Lett. 24(7): 1080-1083 (2011)
- [j35]
- [j34]Zuosong Liang, Erfang Shan: Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. Inf. Process. Lett. 111(23-24): 1104-1107 (2011)
- [j33]Shenwei Huang, Erfang Shan: A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. Networks 57(2): 115-116 (2011)
- 2010
- [j32]Haichao Wang, Erfang Shan: Some matching properties in 4-gamma×2-critical graphs. Computers & Mathematics with Applications 59(2): 694-699 (2010)
- [j31]Erfang Shan, Yancai Zhao: On characterization of uniquely 3-list colorable complete multipartite graphs. Discussiones Mathematicae Graph Theory 30(1): 105-114 (2010)
- [j30]Haichao Wang, Liying Kang, Erfang Shan: Signed clique-transversal functions in graphs. Int. J. Comput. Math. 87(11): 2398-2407 (2010)
- [j29]Lingye Wu, Erfang Shan, Zengrong Liu: On the k-tuple domination of generalized de Brujin and Kautz digraphs. Inf. Sci. 180(22): 4430-4435 (2010)
2000 – 2009
- 2009
- [j28]Mingjing Gao, Erfang Shan: An upper bound on the restrained domination number of graphs. Ars Comb. 91 (2009)
- [j27]
- [j26]
- [j25]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)
- [j24]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)
- [j23]Hongxing Jiang, Liying Kang, Erfang Shan: Total Restrained Domination in Cubic Graphs. Graphs and Combinatorics 25(3): 341-350 (2009)
- [j22]Haichao Wang, Liying Kang, Erfang Shan: Matching Properties in Total Domination Vertex Critical Graphs. Graphs and Combinatorics 25(6): 851-861 (2009)
- [j21]Erfang Shan, Yanxia Dong, Yukun Cheng: The twin domination number in generalized de Bruijn digraphs. Inf. Process. Lett. 109(15): 856-860 (2009)
- 2008
- [j20]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)
- [j19]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)
- [j18]Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo: On matching and total domination in graphs. Discrete Mathematics 308(11): 2313-2318 (2008)
- [j17]Erfang Shan, T. C. Edwin Cheng: Remarks on the minus (signed) total domination in graphs. Discrete Mathematics 308(15): 3373-3380 (2008)
- [j16]Erfang Shan, Zuosong Liang, T. C. Edwin Cheng: Clique-transversal Number in Cubic Graphs. Discrete Mathematics & Theoretical Computer Science 10(2) (2008)
- 2007
- [j15]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)
- [j14]
- [j13]Hong Yan, Xiaoqi Yang, Erfang Shan: Upper minus total domination in small-degree regular graphs. Discrete Mathematics 307(21): 2453-2463 (2007)
- [j12]Erfang Shan, T. C. Edwin Cheng, Liying Kang: Absorbant of generalized de Bruijn digraphs. Inf. Process. Lett. 105(1): 6-11 (2007)
- [j11]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)
- [c2]Zuosong Liang, Erfang Shan, T. C. Edwin Cheng: Clique-Transversal Sets in Cubic Graphs. ESCAPE 2007: 107-115
- 2006
- [j10]Liying Kang, Erfang Shan, Louis Caccetta: Total minus domination in k-partite graphs. Discrete Mathematics 306(15): 1771-1775 (2006)
- [j9]Guangjun Xu, Liying Kang, Erfang Shan: Acyclic domination on bipartite permutation graphs. Inf. Process. Lett. 99(4): 139-144 (2006)
- [j8]Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao: Power domination in block graphs. Theor. Comput. Sci. 359(1-3): 299-305 (2006)
- 2005
- [j7]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
- [j6]Erfang Shan, Chuangyin Dang, Liying Kang: A note on Nordhaus-Gaddum inequalities for domination. Discrete Applied Mathematics 136(1): 83-85 (2004)
- [j5]Erfang Shan, Liying Kang: A note on balance vertices in trees. Discrete Mathematics 280(1-3): 265-269 (2004)
- 2003
- [j4]Erfang Shan, Moo Young Sohn, Liying Kang: Upper bounds on signed 2-independence number of graphs. Ars Comb. 69 (2003)
- [j3]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
- [j2]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
- [c1]Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du: Lower Bounds on the Minus Domination and k-Subdomination Numbers. COCOON 2001: 375-383
- 2000
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:12 CEST by the dblp team