arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.02946cs.DMmath.CO
收藏

次三次图的独立控制

Independent Domination in Subcubic Graphs

A. Akbari, S. Akbari, A. Doosthosseini, Z. Hadizadeh, Michael A. Henning, A. Naraghi

摘要:

一个图$G$中的顶点集$S$是一个控制集,如果每个不在$S$中的顶点都与$S$中的一个顶点相邻。此外,如果$S$是独立集,则$S$是独立支配集。$G$的独立控制数$i(G)$是$G$中独立控制集的最小基数。在2013年Goddard和Henning [Discrete Math 313(2013),839- 854]中,如果$G$是阶为$n$的连通三次图,则$i(G) \le \frac{3}{8}n$,除非$G$是完全二部图$K_{3,3}$或$5$ -棱镜$C_5 \, \Box \, K_2$。进一步,他们构造了两个无限族的连通三次图,其独立控制的阶数是它们的八分之三。他们评论说,也许对$n > 10$来说,这两个家庭只是平等的家庭。本文给出了一类新的$n$阶连通三次图$G$,使得$i(G) = \frac{3}{8}n$ .我们还证明了如果$G$是一个次立方图的顺序$n$没有孤立的顶点,那么$i(G) \le \frac{1}{2}n$,我们的特点,实现平等的图在这个界限。

英文摘要:

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. In 2013 Goddard and Henning [Discrete Math 313 (2013), 839--854] conjectured that if $G$ is a connected cubic graph of order $n$, then $i(G) \le \frac{3}{8}n$, except if $G$ is the complete bipartite graph $K_{3,3}$ or the $5$-prism $C_5 \, \Box \, K_2$. Further they construct two infinite families of connected cubic graphs with independent domination three-eighths their order. They remark that perhaps it is even true that for $n > 10$ these two families are only families for which equality holds. In this paper, we provide a new family of connected cubic graphs $G$ of order $n$ such that $i(G) = \frac{3}{8}n$. We also show that if $G$ is a subcubic graph of order $n$ with no isolated vertex, then $i(G) \le \frac{1}{2}n$, and we characterize the graphs achieving equality in this bound.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑