On the decomposition of $n$-partite graphs based on a vertex-removing synchronised graph product
Combinatorics
2022-06-22 v1
Abstract
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\"ohrle 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.
Keywords
Cite
@article{arxiv.2206.10560,
title = {On the decomposition of $n$-partite graphs based on a vertex-removing synchronised graph product},
author = {Antoon H. Boode},
journal= {arXiv preprint arXiv:2206.10560},
year = {2022}
}
Comments
17 pages, 4 figures