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

盒交图的功能性(functionality)

Functionality of box intersection graphs

Clément Dallard, Vadim Lozin, Martin Milanič, Kenny Štorgel, Viktor Zamaraev

AI总结:

该研究探讨图复杂度度量功能性在盒交图中的有界性,证明区间图功能性有界、三维盒交图无界,并指出对称差参数在区间图和二维单位盒交图中均无界。

摘要:

功能性(functionality)是一种图复杂度度量,可推广顶点度、退化度、团宽度、孪生宽度等多种参数。本文证明,$\n mathbb{R}^1$中的盒交图即区间图的功能性有界,而$\n mathbb{R}^3$中的盒交图功能性无界。我们还研究了介于孪生宽度与功能性之间的对称差参数,证明该参数在区间图和$\n mathbb{R}^2$中的单位盒交图上均无界。

英文摘要:

Functionality is a graph complexity measure that extends a variety of parameters, such as vertex degree, degeneracy, clique-width, or twin-width. In the present paper, we show that functionality is bounded for box intersection graphs in $\mathbb{R}^1$, i.e. for interval graphs, and unbounded for box intersection graphs in $\mathbb{R}^3$. We also study a parameter known as symmetric difference, which is intermediate between twin-width and functionality, and show that this parameter is unbounded both for interval graphs and for unit box intersection graphs in $\mathbb{R}^2$.

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

↑