A Cartesian graph-decomposition theorem based on a vertex-removing synchronised graph product
From MaRDI portal
Publication:6415670
DOI10.5614/EJGTA.2022.10.1.9arXiv2210.17391MaRDI QIDQ6415670FDOQ6415670
Authors: Antoon H. Boode 
Publication date: 31 October 2022
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.
Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76) Applications of graph theory to circuits and networks (94C15) Graph designs and isomorphic decomposition (05C51)
This page was built for publication: A Cartesian graph-decomposition theorem based on a vertex-removing synchronised graph product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6415670)
