Factoring cardinal product graphs in polynomial time

Abstract In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also decomposes finite, connected graphs into their prime factors with respect to the strong product and provides the basis for a new proof of the uniqueness of the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product. Furthermore, some of the consequences of these results and several open problems are discussed.

[1]  Ralph McKenzie,et al.  Cardinal multiplication of structures with a reflexive relation , 1971 .

[2]  Donald J. Miller.  The Categorical Product of Graphs , 1968, Canadian Journal of Mathematics.

[3]  Wilfried Imrich,et al.  Classification of tensor products of symmetric graphs , 1991 .

[4]  Joan Feigenbaum,et al.  Finding the prime factors of strong direct product graphs in polynomial time , 1992, Discret. Math..

[5]  I. J. Schoenberg,et al.  Metric spaces and positive definite functions , 1938 .

[6]  Wilfried Imrich,et al.  Embedding Graphs into Cartesian Products , 1989 .

[7]  Tadasi Nakayama,et al.  On a problem of G. Birkhoff , 1950 .

[8]  Joan Feigenbaum,et al.  A polynomial time algorithm for finding the prime factors of cartesian-product graphs , 1985, Discret. Appl. Math..

[9]  Hans S. Witsenhausen,et al.  Minimum dimension embedding of finite metric spaces , 1986, J. Comb. Theory, Ser. A.

[10]  Wilfried Imrich,et al.  On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs , 1996, Eur. J. Comb..

[11]  Tomás Feder.  Product graph representations , 1992, J. Graph Theory.

[12]  Wilfried Imrich,et al.  On the weak reconstruction of Cartesian-product graphs , 1996, Discret. Math..

[13]  Donald J. Miller.  The automorphism group of a product of graphs , 1970 .

[14]  Pranava K. Jha,et al.  Isomorphic components of Kronecker product of bipartite graphs , 1997, Discuss. Math. Graph Theory.

[15]  P. M. Weichsel.  THE KRONECKER PRODUCT OF GRAPHS , 1962 .

[16]  Wilfried Imrich,et al.  Associative products of graphs , 1975 .

[17]  Peter Winkler,et al.  Factoring a Graph in Polynomial Time , 1987, Eur. J. Comb..

[18]  Wilfried Imrich.  Über das schwache kartesische Produkt von Graphen , 1971 .

[19]  R. Graham,et al.  On isometric embeddings of graphs , 1985 .