RT journal article
T1 Resolvability and Convexity Properties in the Sierpiński Product of Graphs
A1 Henning, M.A.
A1 Klavžar, S.
A1 González Yero, Ismael
A2 Matemáticas
K1 Convex subgraph
K1 Metric dimension
K1 Sierpiński product of graphs
K1 Tree
AB Let G and H be graphs and let f: V(G) → V(H) be a function. The Sierpiński product of G and H with respect to f, denoted by G⊗ fH , 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ń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.
PB Birkhauser: Springer Nature
SN 1660-5446
YR 2024
FD 2024
LK http://hdl.handle.net/10498/31984
UL http://hdl.handle.net/10498/31984
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 12-nov-2026