7 citations · 11 across the 12 of their papers we have counts for
21 papers
Remarks on the vertex and the edge metric dimension of 2-connected graphs
Martin Knor, Jelena Sedlar, Riste Škrekovski
The vertex (resp. edge) metric dimension of a graph G is the size of a smallest vertex set in G which distinguishes all pairs of vertices (resp. edges) in G and it is denoted by di…
Remarks on proper conflict-free colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski
A vertex coloring of a graph is said to be \textit{conflict-free} with respect to neighborhoods if for every non-isolated vertex there is a color appearing exactly once in its (ope…
On maximum Wiener index of directed grids
Martin Knor, Riste Skrekovski
This paper is devoted to Wiener index of directed graphs, more precisely of directed grids. The grid is the Cartesian product of paths on and vertic…
Statistics of Knowledge Graphs Based On The Conceptual Schema
Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski +1
In this paper, we propose a new approach for the computation of the statistics of knowledge graphs. We introduce a schema graph that represents the main framework for the computati…
Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
Jelena Sedlar, Riste Škrekovski
The vertex (resp. edge) metric dimension of a connected graph G; denoted by dim(G) (resp. edim(G)), is defined as the size of a smallest set S in V (G) which distinguishes all pair…
Vertex and edge metric dimensions of cacti
Jelena Sedlar, Riste Škrekovski
In a graph G; a vertex (resp. an edge) metric generator is a set of vertices S such that any pair of vertices (resp. edges) from G is distinguished by at least one vertex from S: T…