149 citations · 707 across the 83 of their papers we have counts for
99 papers
Vertices that belong to every minimum dominating set of a graph and their connection with transportation sharing systems with study cases in Campo de Gibraltar area
Mohammad Farhan, Dorota Kuziak, Iztok Peterin +1
This study addresses a theoretical model regarding equity and accessibility challenges in designing shared transportation systems (such as micro-mobility networks) by applying grap…
A variety of the mutual-visibility coloring problem for graphs
Saneesh Babu, Marko Jakovac, Dorota Kuziak +2
This paper explores variations of vertex-coloring problems defined on graph visibility properties. It introduces and studies the dual, outer, and total mutual-visibility chromatic…
On the Maximum Number of Vertices that Belong to Every Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +2
Metric bases of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. In this paper, we concentrate on the exis…
Multiset resolvability parameters in graphs: A survey with new results and open problems
Mohammad Farhan, Sandi Klavžar, Dorota Kuziak +1
The metric dimension, which has lots of variants and numerous applications in other fields, is one of the most important and most extensively studied topics in metric graph theory.…
The weak -metric dimension of the direct product of complete graphs
Mohammad Farhan, Dorota Kuziak, Ismael G. Yero
The weak -metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices of the graph with the property of uniquely recognizing all the v…
Equidistant dimension of Cartesian product graphs
Adria Gispert-Fernandez, Juan A. Rodriguez-Velazquez, Ismael G. Yero
Given a connected graph , the equidistant dimension of represents the cardinality of the smallest set of vertices of such that for any two vertices the…