Abstract
It is shown that there exist exactly twenty products of graphs defined on the Cartesian product of the vertex sets of the factors where the adjacencies of the vertices only depend on the adjacencies in the factors.
Similar content being viewed by others
References
Berge, C.: The Theory of Graphs and Its Applications. London: Methuen. 1962.
Dörfler, W., undW. Imrich: Das lexikographische Produkt gerichteter Graphen. Mh. Math.76, 21–30 (1972).
Čulík, K.: Zur Theorie der Graphen. Časopis Pěst. Mat.83, 133–155 (1958).
Harary F., andG. Wilcox: Boolean operations on graphs. Math. Scand.20, 41–51 (1967).
Imrich, W.: Über das schwache kartesische Produkt von Graphen. J. Comb. Th. Ser. B11, 1–16 (1971).
Lovász, L.: On the cancellation law among finite relational structures. Periodica Math. Hung.1, 145–156 (1971).
McKenzie, R.: Cardinal multiplication of structures with a reflexive relation. Fund. Math.70, 59–101 (1971).
Miller, D. J.: The categorical product of graphs. Canad. J. Math.20, 1511–1521 (1968).
Miller, D. J. Weak Cartesian product of graphs. Colloquium Math.21, 55–74 (1970).
Pultr, A.: Tensor Products on the Category of Graphs. Combinatorial Structures and Their Applications. New York: Gordon and Breach. 1970.
Sabidussi, G.: Graph multiplication. Math. Z.72, 446–457 (1960).
Weichsel, P. M.: The Kronecker product of graphs. Proc. Amer. Math. Soc.13, 47–52 (1962).
Author information
Authors and Affiliations
Additional information
Dedicated to Prof. N. Hofreiter on his seventieth birthday
Supported by the Canadian National Research Council.
Rights and permissions
About this article
Cite this article
Imrich, W., Izbicki, H. Associative products of graphs. Monatshefte für Mathematik 80, 277–281 (1975). https://doi.org/10.1007/BF01472575
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01472575