基图--联系图的剖析与构造
Base Graph -- Connection Graph: Dissection and Construction
摘要：
本文提出了在四价二部局部镖传递图中有时会出现的一种现象，称为基图--联络图剖分。在这个分解中，每个白色顶点被分成两个价为2的顶点，使得结果的连通分量是同构的。给定其细分与每个组件同构的基图，以及描述组件如何重叠的连接图，在某些情况下，我们可以提供一种可以使图具有这种分解的构造。本文研究了连通图只有一条边的一般现象和特殊情况。
英文摘要：
This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence 2 so that the connected components of the result are isomorphic. Given the Base Graph whose subdivision is isomorphic to each component, and the Connection Graph, which describes how the components overlap, we can, in some cases, provide a construction which can make a graph having such a decomposition. This paper investigates the general phenomenon as well as the special cases in which the connection graph has no more than one edge.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
