paper

Resolvability and convexity properties in the Sierpiński product of graphs

arXiv:2309.15196

Abstract

Let and be graphs and let be a function. The Sierpiński product of and with respect to , denoted by , is defined as the graph on the vertex set , consisting of copies of ; for every edge of there is an edge between copies and of associated with the vertices and of , respectively, of the form . The Sierpiński metric dimension and the upper Sierpiński metric dimension of two graphs are determined. Closed formulas are determined for Sierpiński products of trees, and for Sierpiński products of two cycles where the second factor is a triangle. We also prove that the layers with respect to the second factor in a Sierpiński product graph are convex.