×

Associative products of graphs. (English) Zbl 0328.05136


MSC:

05C99 Graph theory
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Berge, C.: The Theory of Graphs and Its Applications. London: Methuen. 1962. · Zbl 0097.38903
[2] Dörfler, W., undW. Imrich: Das lexikographische Produkt gerichteter Graphen. Mh. Math.76, 21-30 (1972). · Zbl 0234.05109 · doi:10.1007/BF01301004
[3] ?ulík, K.: Zur Theorie der Graphen. ?asopis P?st. Mat.83, 133-155 (1958).
[4] Harary F., andG. Wilcox: Boolean operations on graphs. Math. Scand.20, 41-51 (1967). · Zbl 0152.22801
[5] Imrich, W.: Über das schwache kartesische Produkt von Graphen. J. Comb. Th. Ser. B11, 1-16 (1971). · Zbl 0218.05069 · doi:10.1016/0095-8956(71)90008-6
[6] Lovász, L.: On the cancellation law among finite relational structures. Periodica Math. Hung.1, 145-156 (1971). · Zbl 0223.08002 · doi:10.1007/BF02029172
[7] McKenzie, R.: Cardinal multiplication of structures with a reflexive relation. Fund. Math.70, 59-101 (1971). · Zbl 0228.08002
[8] Miller, D. J.: The categorical product of graphs. Canad. J. Math.20, 1511-1521 (1968). · Zbl 0167.21902 · doi:10.4153/CJM-1968-151-x
[9] Miller, D. J. Weak Cartesian product of graphs. Colloquium Math.21, 55-74 (1970). · Zbl 0195.54301
[10] Pultr, A.: Tensor Products on the Category of Graphs. Combinatorial Structures and Their Applications. New York: Gordon and Breach. 1970. · Zbl 0245.05123
[11] Sabidussi, G.: Graph multiplication. Math. Z.72, 446-457 (1960). · Zbl 0093.37603 · doi:10.1007/BF01162967
[12] Weichsel, P. M.: The Kronecker product of graphs. Proc. Amer. Math. Soc.13, 47-52 (1962). · Zbl 0102.38801 · doi:10.1090/S0002-9939-1962-0133816-6
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.