paper

The Sierpiński product of graphs

arXiv:1904.04180

Abstract

In this paper we introduce a product-like operation that generalizes the construction of generalized Sierpiński graphs. Let be graphs and let be a function. Then the Sierpiński product of and with respect to is defined as a pair , where is a graph on the vertex set with two types of edges: -- is an edge in for every and every , -- is an edge in for every edge ; and is a function that maps every vertex to the vertex . Graph will be denoted by . Function is needed to define the product of more than two factors. By applying this operation times to the same graph we obtain the -th generalized Sierpiński graph. Some basic properties of the Sierpiński product are presented. In particular, we show that is connected if and only if both and are connected and we present some necessary and sufficient conditions that must fulfill in order for to be planar. As for symmetry properties, we show which automorphisms of and extend to automorphisms of . In many cases we can also describe the whole automorphism group of .