论文标题
关于基于顶点驱动的同步图产品的$ n $明确图的分解
On the decomposition of $n$-partite graphs based on a vertex-removing synchronised graph product
论文作者
论文摘要
最近,我们基于在同步定期实时过程中应用的图形产品介绍和修改了图形定理。该顶点解释的同步产品(VRSP)基于著名的笛卡尔产品的修改,并且与Wöhrle和Thomas引起的同步产品密切相关。在这里,我们基于VRSP介绍了一个新的图分解定理,该定理分解了边缘标记的无环n-partite多读物,其中所有标签都是相同的。
Recently, we have introduced and modified graph-decomposition theorems based on a graph product motivated by applications in the context of synchronising periodic real-time processes. This vertex-removing synchronised product (VRSP) is based on modifications of the well-known Cartesian product and is closely related to the synchronised product due to Wöhrle and Thomas. Here, we introduce a new graph-decomposition theorem based on the VRSP that decomposes an edge-labelled acyclic n-partite multigraph where all labels are the same.