48 citations · 253 across the 49 of their papers we have counts for
6 papers · 1 filter
Extremal mixed metric dimension with respect to the cyclomatic number
Jelena Sedlar, Riste Škrekovski
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V(G)U E(G) is called the mixed metric dimension of G, and it is denoted by…
Domination versus independent domination in regular graphs
Martin Knor, Riste Škrekovski, Aleksandra Tepeh
A set of vertices in a graph is a dominating set if every vertex of is in or is adjacent to a vertex in . If, in addition, is an independent set, then is…
Mixed metric dimension of graphs with edge disjoint cycles
Jelena Sedlar, Riste Škrekovski
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we fir…
Bounds on metric dimensions of graphs with edge disjoint cycles
Jelena Sedlar, Riste Škrekovski
In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of suc…
Graphs with the edge metric dimension smaller than the metric dimension
Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi +2
Given a connected graph , the metric (resp. edge metric) dimension of is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of disti…
Bounding the k-rainbow total domination number
Kerry Ojakian, Riste Skrekovski, Aleksandra Tepeh
Recently the notion of -rainbow total domination was introduced for a graph , motivated by a desire to reduce the problem of computing the total domination number of the gene…