arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.2524cs.DMcs.CC
收藏

弦图的顶点叶数

The vertex leafage of chordal graphs

Steven Chaplick, Juraj Stacho

摘要:

每个弦图$G$可以表示为宿主树的子树集合的交集图,即所谓的$G$的{ \em树模型}。连通弦图$G$的叶龄$\ell(G)$是$G$的树模型的宿主树的最小叶数。顶点叶数$\vl(G)$是最小数$k$,使得存在$G$的树模型,其中每个子树最多有$k$叶。叶龄是可通过\cite{esa}的结果多项式计算的参数。在这方面的贡献,我们研究的顶点叶。通过证明一个更强的结果,证明了对于每个固定的$k\geq 3$,判定一个弦图的顶点叶数至多为$k$是NP-完全的,即对于顶点叶数至多为$k+1$的分裂图,判定该问题是NP-完全的.另一方面,对于叶龄最$\ell$的弦图,我们证明了顶点叶龄可以在时间$n^{O(\ell)}$中计算。最后,我们证明了存在一个树模型,实现了$G$的叶子和顶点叶子。值得注意的是,对于每个路径图$G$,在宿主树中存在具有$\ell(G)$叶的路径模型,并且它可以在$O(n^3)$时间内计算。

英文摘要:

Every chordal graph $G$ can be represented as the intersection graph of a collection of subtrees of a host tree, a so-called {\em tree model} of $G$. The leafage $\ell(G)$ of a connected chordal graph $G$ is the minimum number of leaves of the host tree of a tree model of $G$. The vertex leafage $\vl(G)$ is the smallest number $k$ such that there exists a tree model of $G$ in which every subtree has at most $k$ leaves. The leafage is a polynomially computable parameter by the result of \cite{esa}. In this contribution, we study the vertex leafage. We prove for every fixed $k\geq 3$ that deciding whether the vertex leafage of a given chordal graph is at most $k$ is NP-complete by proving a stronger result, namely that the problem is NP-complete on split graphs with vertex leafage of at most $k+1$. On the other hand, for chordal graphs of leafage at most $\ell$, we show that the vertex leafage can be calculated in time $n^{O(\ell)}$. Finally, we prove that there exists a tree model that realizes both the leafage and the vertex leafage of $G$. Notably, for every path graph $G$, there exists a path model with $\ell(G)$ leaves in the host tree and it can be computed in $O(n^3)$ time.

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

↑