A modification of two graph-decomposition theorems based on a vertex-removing synchronised graph product
A modification of two graph-decomposition theorems based on a vertex-removing synchronised graph product
Samenvatting
Recently, we have introduced two graph-decomposition theorems based on a new 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 recall the definition of the VRSP and the two graph-decomposition theorems, we relax the requirements of these two graph-decomposition theorems and prove these two (relaxed) graph-decomposition theorems.
Organisatie | Hogeschool Inholland |
Afdeling | Domein Techniek, Ontwerpen en Informatica |
Lectoraat | Robotica |
Gepubliceerd in | arXiv.org Pagina's: 1-20 |
Datum | 2022-01-17 |
Type | Preprint |
DOI | 10.48550/arXiv.2103.10808 |
Taal | Onbekend |