2.
Resolvability and convexity properties in the Sierpiński product of graphsMichael A. Henning,
Sandi Klavžar,
Ismael G. Yero, 2024, original scientific article
Abstract: Let $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times 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ń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.
Keywords: Sierpiński product of graphs, metric dimension, trees, convex subgraph
Published in DiRROS: 16.02.2024; Views: 288; Downloads: 126
Full text (432,07 KB)
This document has many files! More...