Resolvability and Convexity Properties in the Sierpiński Product of Graphs

Identificadores
URI: http://hdl.handle.net/10498/31984
DOI: 10.1007/s00009-023-02544-6
ISSN: 1660-5446
ISSN: 1660-5454
Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2024Departamento/s
MatemáticasFuente
Mediterranean Journal of Mathematics - 2023, Vol.21, n.1, pp. 1-17Resumen
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.
Materias
Convex subgraph; Metric dimension; Sierpiński product of graphs; TreeColecciones
- Artículos Científicos [12077]
- Articulos Científicos Matemáticas [519]






