48 citations · 253 across the 49 of their papers we have counts for
61 papers
Spreads of degrees in maximal planar graphs -- an exposition
Yair Caro, Riste Škrekovski, Christina Zarb
For a graph and a set , the spread of is the difference between the largest and the smallest degree in of a vertex of , and for an…
An improved upper bound for the fair domination number of maximal outerplanar graphs
Yair Caro, Riste Škrekovski
A dominating set of a graph is a \emph{fair dominating set} if every two vertices outside have the same number of neighbors in , and the \emph{fair domination number…
Spreads of degrees in graphs
Yair Caro, Riste Škrekovski, Christina Zarb
For a graph and a set , the spread of is the difference between the largest and the smallest degree in of a vertex of , and for an…
Proper conflict-free degree-choosability of outerplanar graphs
Masaki Kashima, Riste Škrekovski, Rongxing Xu
A proper coloring of is called a proper conflict-free coloring of if for every non-isolated vertex of , there is a color such that …
Invitation to the subpath number
Martin Knor, Jelena Sedlar, Riste Škrekovski +1
In this paper we count all the subpaths of a given graph G; including the subpaths of length zero, and we call this quantity the subpath number of G. The subpath number is related…
Extremizing antiregular graphs by modifying total -irregularity
Martin Knor, Riste Škrekovski, Slobodan Filipovski +1
The total -irregularity is given by where indicates the degree of a vertex within the gra…
On strong odd colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski +1
A strong odd coloring of a simple graph is a proper coloring of the vertices of such that for every vertex and every color , either is used an odd number of time…
Domination number of modular product graphs
Sergio Bermudo, Iztok Peterin, Jelena Sedlar +1
The modular product of graphs and is a graph on vertex set . Two vertices and of are adjacent…
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…
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
Jelena Sedlar, Riste Škrekovski
An edge e is normal in a proper edge-coloring of a cubic graph G if the number of distinct colors on four edges incident to e is 2 or 4: A normal edge-coloring of G is a proper edg…
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph
Jelena Sedlar, Riste Škrekovski
In a (proper) edge-coloring of a bridgeless cubic graph G an edge e is rich (resp. poor) if the number of colors of all edges incident to end-vertices of e is 5 (resp. 3). An edge-…
Selected topics on Wiener index
Martin Knor, Riste Škrekovski, Aleksandra Tepeh
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, wh…
On regular graphs with Šoltés vertices
Nino Bašić, Martin Knor, Riste Škrekovski
Let be the Wiener index of a graph . We say that a vertex is a Šoltés vertex in if , i.e. the Wiener index does not change if the vertex…
Criticality in Sperner's Lemma
Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski
We answer a question posed by T. Gallai in 1969 concerning criticality in Sperner's lemma, listed as Problem 9.14 in the collection of Jensen and Toft [Graph coloring problems, Joh…
Local Irregularity Conjecture vs. cacti
Jelena Sedlar, Riste Škrekovski
A graph is locally irregular if the degrees of the end-vertices of every edge are distinct. An edge coloring of a graph G is locally irregular if every color induces a locally irre…
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…
Remarks on odd colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski
A proper vertex coloring of graph is said to be odd if for each non-isolated vertex there exists a color such that is odd-sized. The mi…
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…
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…
Odd edge-colorings of subdivisions of odd graphs
Mirko Petruševski, Riste Škrekovski
An odd graph is a finite graph all of whose vertices have odd degrees. Given graph is decomposable into odd subgraphs if its edge set can be partitioned into subsets ea…
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…