树的独立支配数的新下界

Abel Cabrera Martínez
{"title":"树的独立支配数的新下界","authors":"Abel Cabrera Martínez","doi":"10.1051/ro/2023100","DOIUrl":null,"url":null,"abstract":"A set $D$ of vertices in a graph $G$ is an independent dominating set of $G$ if $D$ is an independent set and every vertex not in $D$ is adjacent to a vertex in $D$. The independent domination number of $G$, denoted by $i(G)$, is the minimum cardinality among all independent dominating sets of $G$. In this paper we show that if $T$ is a nontrivial tree, then $i(T)\\geq \\frac{n(T)+\\gamma(T)-l(T)+2}{4}$, where $n(T)$, $\\gamma(T)$ and $l(T)$ represent the order, the domination number and the number of leaves of $T$, respectively. In addition, we characterize the trees achieving this new lower bound.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new lower bound for the independent domination number of a tree\",\"authors\":\"Abel Cabrera Martínez\",\"doi\":\"10.1051/ro/2023100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A set $D$ of vertices in a graph $G$ is an independent dominating set of $G$ if $D$ is an independent set and every vertex not in $D$ is adjacent to a vertex in $D$. The independent domination number of $G$, denoted by $i(G)$, is the minimum cardinality among all independent dominating sets of $G$. In this paper we show that if $T$ is a nontrivial tree, then $i(T)\\\\geq \\\\frac{n(T)+\\\\gamma(T)-l(T)+2}{4}$, where $n(T)$, $\\\\gamma(T)$ and $l(T)$ represent the order, the domination number and the number of leaves of $T$, respectively. In addition, we characterize the trees achieving this new lower bound.\",\"PeriodicalId\":20872,\"journal\":{\"name\":\"RAIRO Oper. Res.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2023100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如果$D$是一个独立的集合,并且不在$D$中的每个顶点都与$D$中的一个顶点相邻,那么图$G$中的顶点集$D$就是$G$的独立支配集。$G$的独立支配数用$i(G)$表示,它是$G$的所有独立支配集的最小基数。本文证明了如果$T$是一棵非平凡树,那么$i(T)\geq \frac{n(T)+\gamma(T)-l(T)+2}{4}$,其中$n(T)$、$\gamma(T)$和$l(T)$分别表示$T$的阶数、支配数和叶数。此外,我们描述了实现这个新的下界的树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new lower bound for the independent domination number of a tree
A set $D$ of vertices in a graph $G$ is an independent dominating set of $G$ if $D$ is an independent set and every vertex not in $D$ is adjacent to a vertex in $D$. The independent domination number of $G$, denoted by $i(G)$, is the minimum cardinality among all independent dominating sets of $G$. In this paper we show that if $T$ is a nontrivial tree, then $i(T)\geq \frac{n(T)+\gamma(T)-l(T)+2}{4}$, where $n(T)$, $\gamma(T)$ and $l(T)$ represent the order, the domination number and the number of leaves of $T$, respectively. In addition, we characterize the trees achieving this new lower bound.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信