arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.05458math.CO
收藏

连通k-控制图

Connected k-Dominating Graphs

C. M. Mynhardt, R. Roux, L. E. Teshima

摘要:

对于图G=(V,E),G的k-控制图(记为$D_{k}(G)$)的顶点对应于G的基数最大为k的控制集,其中$D_{k}(G)$的两个顶点相邻当且仅当其中一个顶点对应的控制集可以从第二个顶点对应的控制集通过添加或删除一个顶点得到。我们用$d_{0}(G)$表示对于所有大于或等于$d_{0}(G)$的k,$D_{k}(G)$连接的最小整数。已知$d_{0}(G)$介于$Γ(G)+1$和$|V|$之间,其中$Γ(G)$是G的上控制数,但是构造图G使得$d_{0}(G)>Γ(G)+1$似乎是困难的。我们提出了两个相关的结构。第一种构造表明,对于每个大于或等于3的整数k和从1到k-1的每个整数r,存在图$G_{k,r}$使得$Γ(G_{k,r})=k, γ(G_{k,r})=r+1$和$d_{0}(G_{k,r})=k+r=Γ(G)+γ(G)-1$。第二种构造表明,对于每个大于或等于3的整数k和从1到k-1的每个整数r,存在图$Q_{k,r}$,使得$Γ(Q_{k,r})=k, γ(Q_{k,r})=r$和$d_{0}(Q_{k,r})=k+r=Γ(G)+γ(G)$。

英文摘要:

For a graph G=(V,E), the k-dominating graph of G, denoted by $D_{k}(G)$, has vertices corresponding to the dominating sets of G having cardinality at most k, where two vertices of $D_{k}(G)$ are adjacent if and only if the dominating set corresponding to one of the vertices can be obtained from the dominating set corresponding to the second vertex by the addition or deletion of a single vertex. We denote by $d_{0}(G)$ the smallest integer for which $D_{k}(G)$ is connected for all k greater than or equal to $d_{0}(G)$. It is known that $d_{0}(G)$ lies between $Γ(G)+1$ and $|V|$ (inclusive), where $Γ(G)$ is the upper domination number of G, but constructing a graph G such that $d_{0}(G)>Γ(G)+1$ appears to be difficult. We present two related constructions. The first construction shows that for each integer k greater than or equal to 3 and each integer r from 1 to k-1, there exists a graph $G_{k,r}$ such that $Γ(G_{k,r})=k, γ(G_{k,r})=r+1$ and $d_{0}(G_{k,r})=k+r=Γ(G)+γ(G)-1$. The second construction shows that for each integer k greater than or equal to 3 and each integer r from 1 to k-1, there exists a graph $Q_{k,r}$ such that $Γ(Q_{k,r})=k, γ(Q_{k,r})=r$ and $d_{0}(Q_{k,r})=k+r=Γ(G)+γ(G)$.

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

↑