-
摘要: 对于任意的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:
- signed edge domination numberodd cycletree /
点击查看大图
计量
- 文章访问数: 2661
- HTML全文浏览量: 10
- PDF下载量: 1193
- 被引次数: 0