149 citations · 707 across the 83 of their papers we have counts for
9 papers · 1 filter
Relating the outer-independent total Roman domination number with some classical parameters of graphs
Abel Cabrera Martínez, Dorota Kuziak, Ismael G. Yero
For a given graph without isolated vertex we consider a function . For every , let . The function $f…
Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results
Dorota Kuziak, Ismael G. Yero
Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an att…
Injective coloring of graphs revisited
Boštjan Brešar, Babak Samadi, Ismael G. Yero
An open packing in a graph is a set of vertices in such that no two vertices in have a common neighbor in . The injective chromatic number of is the…
Roman domination in direct product graphs and rooted product graphs
Abel Cabrera Martinez, Iztok Peterin, Ismael G. Yero
Let be a graph with vertex set . A function is a Roman dominating function on if every vertex for which is adjacent…
A Steiner general position problem in graph theory
Sandi Klavžar, Dorota Kuziak, Iztok Peterin +1
Let be a graph. The Steiner distance of is the minimum size of a connected subgraph of containing . Such a subgraph is necessarily a tree called a Stei…
On Vertices Contained in All or in No Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +1
A set is a resolving set of a graph if for all distinct vertices there exists an element such that . The metric…