Journal of East China Normal University(Natural Sc ›› 2011, Vol. 2011 ›› Issue (3): 40-43.

• Article • Previous Articles     Next Articles

Lower bounds of signed edge domination numbers in graphs

JIAO Jiao1; SHANG Hua-hui2; ZHANG Geng1

  

  1. 1. College of Sciences, China University of Mining and Technology, Xuzhou Jiangsu 211008, China 2. Department of Basic Courses, Yongcheng Vocational College, Yongcheng Henan 476600, China
  • Received:2010-03-01 Revised:2010-06-01 Online:2011-05-25 Published:2011-05-25
  • Contact: JIAO Jiao

Abstract: This paper showed the lower bounds of signed edge domination number of G, if there is a maximum elementary graph which is an induced subgraph of G; Also showed the lower bounds of signed edge domination number for every nontrivial tree T of order n.

Key words: odd cycle, tree, signed edge domination number, odd cycle, tree

CLC Number: