48 citations · 253 across the 49 of their papers we have counts for
9 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…
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…
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…
A note on the metric and edge metric dimensions of 2-connected graphs
Martin Knor, Riste Skrekovski, Ismael G. Yero
For a given graph , the metric and edge metric dimensions of , and , are the cardinalities of the smallest possible subsets of vertices in suc…
On Metric Dimensions of Hypercubes
Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski +1
The metric (resp. edge metric or mixed metric) dimension of a graph , is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distin…
On -regular nut graphs
Nino Bašić, Martin Knor, Riste Škrekovski
A nut graph is a simple graph whose adjacency matrix is singular with -dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. cha…