Abstract
Recently, we have introduced 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 closely related to the synchronised product due to Wöhrle and Thomas. Here, we recall the definition of the VRSP and use it to define two different decompositions of graphs. Although our main results apply to directed labelled acyclic multigraphs, the VRSP can also be used to decompose any undirected graph of order at least 4 into two smaller graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
