A Cartesian graph-decomposition theorem based on a vertex-removing synchronised graph product
Combinatorics
2022-11-01 v1
Abstract
Recently, we have introduced and modified 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\"ohrle and Thomas. Here, we introduce a new graph-decomposition theorem based on the VRSP that provides a Cartesian decomposition of graphs.
Keywords
Cite
@article{arxiv.2210.17391,
title = {A Cartesian graph-decomposition theorem based on a vertex-removing synchronised graph product},
author = {Antoon H. Boode},
journal= {arXiv preprint arXiv:2210.17391},
year = {2022}
}
Comments
8 pages, 3 figures. arXiv admin note: text overlap with arXiv:2206.10560