149 citations · 707 across the 83 of their papers we have counts for
7 papers · 1 filter
Resolvability and convexity properties in the Sierpiński product of graphs
Michael A. Henning, Sandi Klavžar, Ismael G. Yero
Let and be graphs and let be a function. The Sierpiński product of and with respect to , denoted by , is defined…
Resolving vertices of graphs with differences
Iztok Peterina, Jelena Sedlar, Riste Škrekovski +1
The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances t…
Lower (total) mutual visibility in graphs
Boštjan Brešar, Ismael G. Yero
Given a graph , a set of vertices in satisfying that between every two vertices in (respectively, in ) there is a shortest path whose internal vertices are not in…
Injective coloring of product graphs
Babak Samadi, Nasrin Soltankhah, Ismael G. Yero
The problem of injective coloring in graphs can be revisited through two different approaches: coloring the two-step graphs and vertex partitioning of graphs into open packing sets…
Lower General Position Sets in Graphs
Gabriele Di Stefano, Sandi Klavžar, Aditi Krishnakumar +2
A subset of vertices of a graph is a \emph{general position set} if no shortest path in contains three or more vertices of . In this paper, we generalise a problem o…
Variety of mutual-visibility problems in graphs
Serafino Cicerone, Gabriele Di Stefano, Lara Drozek +3
If is a subset of vertices of a graph , then vertices and are -visible if there exists a shortest -path such that . If each…