Resolvability and convexity properties in the Sierpi\'nski product of graphs
Abstract
Let G and H be graphs and let f V(G)→ V(H) be a function. The Sierpi\'nski product of G and H with respect to f, denoted by G f H, is defined as the graph on the vertex set V(G)× V(H), consisting of |V(G)| copies of H; for every edge gg' of G there is an edge between copies gH and g'H of H associated with the vertices g and g' of G, respectively, of the form (g,f(g'))(g',f(g)). The Sierpi\'nski metric dimension and the upper Sierpi\'nski metric dimension of two graphs are determined. Closed formulas are determined for Sierpi\'nski products of trees, and for Sierpi\'nski 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\'nski product graph are convex.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.