Note on decompositions based on the vertex-removing synchronised graph product

DOI10.5614/EJGTA.2022.10.1.9MaRDI QIDQ5081213zbMATH OpenOpenAlexFDO

Authors Antoon H. Boode

Publication date 14 June 2022

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2022.10.1.9

zbMATH Keywords

graph decompositionproduct graphsynchronising processesvertex removing synchronised product

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph designs and isomorphic decomposition (05C51) Graph operations (line graphs, products, etc.) (05C76) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Decompositions of graphs based on a new graph product
• Graph decompositions for cartesian products
• scientific article; zbMATH DE number 3907796
• A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product
• The Cartesian product of graphs with loops

Cites work

• Decompositions of graphs based on a new graph product
• Graph theory
• On a directed tree problem motivated by a newly introduced graph product

Cited in

(2)

• Decompositions of graphs based on a new graph product
• A Cartesian graph-decomposition theorem based on a vertex-removing synchronised graph product

This page was built for publication: Note on decompositions based on the vertex-removing synchronised graph product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081213)