Products and tensor products of graphs and homomorphisms
Combinatorics
2017-02-10 v2
Abstract
We introduce and study, for a process P delivering edges on the Cartesian product of the vertex sets of a given set of graphs, the P-product of these graphs, thereby generalizing many types of product graph. Analogous to the notion of a multilinear map (from linear algebra), a P-morphism is introduced and utilised to define a P-tensor product of graphs, after which its uniqueness is demonstrated. Congruences of graphs are utilised to show a way to handle projections (being weak homomorphisms) in this context. Finally, the graph of a homomorphism and a P-tensor product of homomorphisms are introduced, studied, and linked to the P-tensor product of graphs.
Keywords
Cite
@article{arxiv.1612.00601,
title = {Products and tensor products of graphs and homomorphisms},
author = {Izak Broere and Johannes Heidema},
journal= {arXiv preprint arXiv:1612.00601},
year = {2017}
}
Comments
Comments: 12 pages; Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)