Note on decompositions based on the vertex-removing synchronised graph product
Abstract
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 show how we can relax the requirements of these two graph-decomposition theorems.
Keywords
Full Text:
PDFDOI: http://dx.doi.org/10.5614/ejgta.2022.10.1.9
References
J. A. Bondy and U. S. R. Murty. Graph Theory. Springer, Berlin (2008).
A. H. Boode. A modification of two graph-decomposition theorems based on a vertex- removing synchronised graph product. arXiv: 2103.10808 (2021)
A. H. Boode. On the Automation of Periodic Hard Real-Time Processes: A Graph-Theoretical Approach. PhD thesis, University of Twente (2018). DOI: 10.3990/1.9789036545518
A. H. Boode and J. F. Broenink. Performance of periodic real-time processes: a vertex-removing synchronised graph product. In Communicating Process Architectures 2014, Oxford, UK, 36th WoTUG conference on concurrent and parallel programming, pages 119–138, Bicester, August 2014. Open Channel Publishing Ltd.
A. H. Boode, and H. J. Broersma. Decompositions of graphs based on a new graph product. Discrete Applied Mathematics. 259 (2019) 31–40.
A. H. Boode, H. J. Broersma, and J. F. Broenink. Improving the performance of periodic real-time processes: a graph-theoretical approach. In Communicating Process Architectures 2013, Edinburgh, UK, 35th WoTUG conference on concurrent and parallel programming, pages 57–79, Bicester, August 2013. Open Channel Publishing Ltd.
A. H. Boode, H. J. Broersma, and J. F. Broenink. On a directed tree problem motivated by a newly introduced graph product. Electr. J. of Graph Theory and Appl. 3 (2015) 162–181.
Refbacks
- There are currently no refbacks.
ISSN: 2338-2287
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.