English

The Sierpi\'nski product of graphs

Combinatorics 2019-04-09 v1

Abstract

In this paper we introduce a product-like operation that generalizes the construction of generalized Sierpi\'nski graphs. Let G,HG,H be graphs and let f:V(G)V(H)f: V(G) \to V(H) be a function. Then the Sierpi\'nski product of GG and HH with respect to ff is defined as a pair (K,φ)(K,\varphi), where KK is a graph on the vertex set V(G)×V(H)V(G) \times V(H) with two types of edges: -- {(g,h),(g,h)}\{(g,h),(g,h')\} is an edge in KK for every gV(G)g\in V(G) and every {h,h}E(H)\{h,h'\}\in E(H), -- {(g,f(g),(g,f(g))}\{(g,f(g'),(g',f(g))\} is an edge in KK for every edge {g,g}E(G)\{g,g'\} \in E(G); and φ:V(G)V(K)\varphi: V(G) \to V(K) is a function that maps every vertex gV(G)g \in V(G) to the vertex (g,f(g))V(K)(g,f(g)) \in V(K). Graph KK will be denoted by GfHG\otimes_f H. Function φ\varphi is needed to define the product of more than two factors. By applying this operation nn times to the same graph we obtain the nn-th generalized Sierpi\'nski graph. Some basic properties of the Sierpi\'nski product are presented. In particular, we show that GfHG \otimes_f H is connected if and only if both GG and HH are connected and we present some necessary and sufficient conditions that G,HG,H must fulfill in order for GfHG \otimes_f H to be planar. As for symmetry properties, we show which automorphisms of GG and HH extend to automorphisms of GfHG \otimes_f H. In many cases we can also describe the whole automorphism group of GfHG\otimes_f H.

Keywords

Cite

@article{arxiv.1904.04180,
  title  = {The Sierpi\'nski product of graphs},
  author = {Jurij Kovič and Tomaž Pisanski and Sara Sabrina Zemljič and Arjana Žitnik},
  journal= {arXiv preprint arXiv:1904.04180},
  year   = {2019}
}