The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Erfang Shan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
    Lower Bounds on the Minus Domination and k-Subdomination Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:375-383 [Conf]
  2. Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Erfang Shan
    A note on domination and minus domination numbers in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2005, v:18, n:9, pp:1062-1067 [Journal]
  3. Liying Kang, Erfang Shan
    Lower bounds on dominating functions in graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  4. Erfang Shan, Moo Young Sohn, Liying Kang
    Upper bounds on signed 2-independence number of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  5. Erfang Shan, Chuangyin Dang, Liying Kang
    A note on Nordhaus-Gaddum inequalities for domination. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:1, pp:83-85 [Journal]
  6. Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan
    Upper bounds for the k-subdomination number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:229-234 [Journal]
  7. Erfang Shan, Liying Kang
    A note on balance vertices in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:265-269 [Journal]
  8. Liying Kang, Erfang Shan, Louis Caccetta
    Total minus domination in k-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:15, pp:1771-1775 [Journal]
  9. Guangjun Xu, Liying Kang, Erfang Shan
    Acyclic domination on bipartite permutation graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:4, pp:139-144 [Journal]
  10. Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
    Lower bounds on the minus domination and k-subdomination numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:89-98 [Journal]
  11. Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao
    Power domination in block graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:299-305 [Journal]
  12. Erfang Shan, Liying Kang, Michael A. Henning
    Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:4, pp:350-353 [Journal]
  13. Zuosong Liang, Erfang Shan, T. C. Edwin Cheng
    Clique-Transversal Sets in Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:107-115 [Conf]
  14. Hong Yan, Xiaoqi Yang, Erfang Shan
    Upper minus total domination in small-degree regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:21, pp:2453-2463 [Journal]

  15. Proof of a conjecture on k-tuple domination in graphs. [Citation Graph (, )][DBLP]


  16. Bondage number in oriented graphs. [Citation Graph (, )][DBLP]


  17. An application of the Turán theorem to domination in graphs. [Citation Graph (, )][DBLP]


  18. A polynomial-time algorithm for the paired-domination problem on permutation graphs. [Citation Graph (, )][DBLP]


  19. Upper bounds on the upper signed total domination number of graphs. [Citation Graph (, )][DBLP]


  20. Remarks on the minus (signed) total domination in graphs. [Citation Graph (, )][DBLP]


  21. On matching and total domination in graphs. [Citation Graph (, )][DBLP]


  22. Clique-transversal Number in Cubic Graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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