Cancellation and regularity for planar, 3-connected Kronecker products

TL;DR

This paper studies properties of planar, 3-connected Kronecker product graphs, proving cancellation holds in this case and characterizing when such graphs are also Cartesian products or face/vertex-regular.

Contribution

It proves Kronecker cancellation for planar, 3-connected graphs and characterizes planar graphs that are Cartesian or Kronecker products, advancing understanding of graph product uniqueness.

Findings

Cancellation holds for planar, 3-connected Kronecker products.

Characterization of planar graphs that are Cartesian products in two ways.

Classification of face-regular and vertex-regular polyhedral Kronecker products.

Abstract

We investigate several properties of Kronecker (direct, tensor) products of graphs that are planar and $3$-connected (polyhedral, $3$-polytopal). This class of graphs was recently characterised and constructed by the second author [15]. Our main result is that cancellation holds for the Kronecker product of graphs when the product is planar and $3$-connected (it is known that Kronecker cancellation may fail in general). Equivalently, polyhedral graphs are Kronecker products in at most one way. This is a special case of the deep and interesting question, open in general, of Kronecker product cancellation for simple graphs: when does $A\wedge C\simeq B\wedge C$ imply $A\simeq B$? We complete our investigation on simultaneous products by characterising and constructing the planar graphs that are Cartesian products in two distinct ways, and the planar, $3$-connected graphs that are both Kronecker and Cartesian products. The other type of results we obtain are in extremal graph theory. We classify the polyhedral Kronecker products that are either face-regular or vertex-regular graphs. The face-regular ones are certain quadrangulations of the sphere, while the vertex-regular ones are certain cubic graphs (duals of maximal planar graphs). We also characterise, and iteratively construct, the face-regular subclass of graphs minimising the number of vertices of degree $3$.