149 citations · 707 across the 83 of their papers we have counts for
6 papers · 1 filter
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…
Dominating the direct product of two graphs through total Roman strategies
Abel Cabrera Martinez, Dorota Kuziak, Iztok Peterin +1
Given a graph without isolated vertices, a total Roman dominating function for is a function such that every vertex with label 0 is adjacent…
Maker-Breaker resolving game
Cong X. Kang, Sandi Klavžar, Ismael G. Yero +1
A set of vertices of a graph is a resolving set if every vertex of is uniquely determined by its vector of distances to . In this paper, the Maker-Breaker resolving…
General -position sets
Sandi Klavzar, Douglas F. Rall, Ismael G. Yero
The general -position number of a graph is the cardinality of a largest set for which no three distinct vertices from lie on a common geodesic of len…
A note on total co-independent domination in trees
Abel Cabrera Martínez, Frank A. Hernández Mira, José M. Sigarreta Almira +1
A set of vertices of a graph is a total dominating set if every vertex of is adjacent to at least one vertex of . The total domination number of is the minimum c…
Covering Italian domination in graphs
Abdollah Khodkar, Doost Ali Mojdeh, Babak Samadi +1
For a graph , an Italian dominating function (ID function) of is a function such that for each vertex with , $f…