arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.7434math.CO
收藏

完全图与路的强积的束缚数

The Bondage Number of the Strong Product of a Complete Graph and a Path

Weisheng Zhao, Heping Zhang

摘要:

图$G$的束缚数$b(G)$是最小边集的基数,该最小边集从$G$中移除会导致图的控制数大于$G$的控制数。它是衡量通信网络在链路故障下脆弱性的一个参数。本文给出了完全图与路的强积的束缚数的精确值,即对任意两个整数$m\geq1$和$n\geq2$,若$n\equiv 0$(mod 3)为$b(K_{m}\boxtimes P_{n})=\lceil\frac{m}{2}\rceil$,若$n\equiv 2$(mod 3)为$m$,若$n\equiv 1$(mod 3)为$\lceil\frac{3m}{2}\rceil$.此外,我们还确定了完全图与特殊星形树的强积的束缚数的精确值。

英文摘要:

The bondage number $b(G)$ of a graph $G$ is the cardinality of a minimum edge set whose removal from $G$ results in a graph with the domination number greater than that of $G$. It is a parameter to measure the vulnerability of a communication network under link failure. In this paper, we obtain the exact value of the bondage number of the strong product of a complete graph and a path. That is, for any two integers $m\geq1$ and $n\geq2$, $b(K_{m}\boxtimes P_{n})=\lceil\frac{m}{2}\rceil$ if $n\equiv 0$ (mod 3); $m$ if $n\equiv 2$ (mod 3); $\lceil\frac{3m}{2}\rceil$ if $n\equiv 1$ (mod 3). Furthermore, we determine the exact value of the bondage number of the strong product of a complete graph and a special starlike tree.

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

↑