On the decomposition of n-partite graphs based on a vertex-removing synchronised graph product
Rechten:
On the decomposition of n-partite graphs based on a vertex-removing synchronised graph product
Rechten:
Samenvatting
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.
| Organisatie | Hogeschool Inholland |
| Afdeling | Domein Techniek, Ontwerpen en Informatica |
| Lectoraat | Robotica |
| Gepubliceerd in | arXiv.org Pagina's: 1-17 |
| Datum | 2022-06-21 |
| Type | Preprint |
| DOI | 10.48550/arXiv.2206.10560 |
| Taal | Onbekend |
