12 citations · 16 across the 17 of their papers we have counts for
5 papers · 1 filter
Remarks on the Local Irregularity Conjecture
Jelena Sedlar, Riste Škrekovski
A locally irregular graph is a graph in which the end-vertices of every edge have distinct degrees. A locally irregular edge coloring of a graph G is any edge coloring of G such th…
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…
Learning to solve geometric construction problems from images
J. Macke, J. Sedlar, M. Olsak +2
We describe a purely image-based method for finding geometric constructions with a ruler and compass in the Euclidea geometric game. The method is based on adapting the Mask R-CNN…
Vertex and edge metric dimensions of unicyclic graphs
Jelena Sedlar, Riste Škrekovski
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) (resp. E(G)) is called the vertex (resp. edge) metric dimension of G…