Abstract In a recent article by Bona and Vince, the authors studied the concept of an assembly tree for a graph motivated by the way that macromolecules assemble. Assembly trees act as record keeping devices for the construction of a given graph from its vertices. In the original article, graphs were to be assembled following an edge gluing rule for the vertices. In this paper, we first define and enumerate assembly trees that are constructed using a connected gluing rule. Following this, we examine how introducing a notion of time to assembly trees changes how they are counted using both gluing rules.

中文翻译：

---

如何在 n 天内构建图形：图形组装的一些变体

摘要 在博纳和文斯最近的一篇文章中，作者研究了由大分子组装方式驱动的图的组装树的概念。装配树充当从顶点构建给定图的记录保存设备。在原始文章中，将按照顶点的边粘合规则组装图。在本文中，我们首先定义和枚举使用连接的粘合规则构建的装配树。在此之后，我们研究了将时间概念引入装配树如何改变使用两种粘合规则计算它们的方式。