华东师范大学学报(自然科学版) ›› 2011, Vol. 2011 ›› Issue (3): 40-43.

• 应用数学与基础数学 • 上一篇    下一篇

图的符号边控制数的下界

焦 姣1; 尚华辉2; 张 埂1   

  1. 1. 中国矿业大学 理学院, 江苏 徐州 221008; 2. 永城职业学院 基础部, 河南 永城476600
  • 收稿日期:2010-03-01 修回日期:2010-06-01 出版日期:2011-05-25 发布日期:2011-05-25
  • 通讯作者: 焦姣

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

PDF

1332

摘要： 对于任意的n阶图G, 当存在一个最大的奇元素子图是图G的导出子图, 给出了图G的符号边控制数的一个下界. 此外, 还改进了任意非平凡的n阶树T的符号边控制数的下界.

关键词: 符号边控制数, 奇圈, 树, 符号边控制数, 奇圈, 树

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

中图分类号: