arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.08262math.COcs.DM
收藏

Penrose P2 图的叶子函数

The Leaf Function of Penrose P2 Graphs

Carole Porrier, Alain Goupil, Alexandre Blondin Massé

AI总结:

该文研究 Penrose P2 图中给定顶点数的最大叶子诱导子树,利用铺砌替换与局部同构给出叶子函数的精确及递归公式。

摘要:

我们研究 Penrose P2 图中的一个图论问题,这些图是由风筝和飞镖构成的 Penrose 铺砌的对偶图。利用替换、局部同构以及 Penrose 铺砌的其他性质,我们构造了一族任意大的 Penrose 图诱导子树;对于给定顶点数 n,这些子树具有最大可能的叶子数。这类子树被称为满叶诱导子树。对任意非负整数 n,我们将其叶子数记为 L_{P2}(n),序列 (L_{P2}(n))_{n∈ℕ} 称为 Penrose P2 图的叶子函数。我们给出了 L_{P2}(n) 的精确公式和递归公式,以及一个由满叶诱导子树组成的无限序列,这些子树都是毛虫图。特别地,我们的证明依赖于构造一个由 3-内部正则子树组成的有限分次偏序集。

英文摘要:

We study a graph-theoretic problem in the Penrose P2-graphs which are the dual graphs of Penrose tilings by kites and darts. Using substitutions, local isomorphism and other properties of Penrose tilings, we construct a family of arbitrarily large induced subtrees of Penrose graphs with the largest possible number of leaves for a given number $n$ of vertices. These subtrees are called fully leafed induced subtrees. We denote their number of leaves $L_{P2}(n)$ for any non-negative integer $n$, and the sequence $\left(L_{P2}(n)\right)_{n\in\mathbb{N}}$ is called the leaf function of Penrose P2-graphs. We present exact and recursive formulae for $L_{P2}(n)$, as well as an infinite sequence of fully leafed induced subtrees, which are caterpillar graphs. In particular, our proof relies on the construction of a finite graded poset of 3-internal-regular subtrees.

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

↑