| Publication | Date of Publication | Type |
|---|
| The \(k\)-distance mutual-visibility problem in graphs | 2025-01-10 | Paper |
| Complexity issues concerning the quadruple Roman domination problem in graphs | 2025-01-08 | Paper |
| A note on total co-independent domination in trees | 2024-11-20 | Paper |
| Complexity and equivalency of multiset dimension and ID-colorings | 2024-10-07 | Paper |
| Mutual-visibility in strong products of graphs via total mutual-visibility | 2024-09-26 | Paper |
| On the total version of the covering Italian domination problem | 2024-09-26 | Paper |
| Mutual-visibility problems on graphs of diameter two | 2024-07-08 | Paper |
| Resolving vertices of graphs with differences | 2024-07-08 | Paper |
| Lower (total) mutual-visibility number in graphs | 2024-04-16 | Paper |
| Resolvability and convexity properties in the Sierpiński product of graphs | 2024-01-22 | Paper |
| On mixed metric dimension in subdivision, middle, and total graphs | 2023-11-21 | Paper |
| TRAVERSING A GRAPH IN GENERAL POSITION | 2023-11-14 | Paper |
| Variety of mutual-visibility problems in graphs | 2023-09-18 | Paper |
| Resolving vertices of graphs with differences | 2023-09-02 | Paper |
| Injective coloring of product graphs | 2023-06-02 | Paper |
| The Edge Partition Dimension of Graphs | 2023-04-28 | Paper |
| On the (k,l)-anonymity of networks via their $k$-metric antidimension | 2023-04-03 | Paper |
| Complexity and equivalency of multiset dimension and ID-colorings | 2023-03-13 | Paper |
| Injective coloring of graphs revisited | 2023-03-10 | Paper |
| On metric dimensions of hypercubes | 2023-01-23 | Paper |
| Further contributions on the outer multiset dimension of graphs | 2023-01-04 | Paper |
| Mutual-visibility in strong products of graphs via total mutual-visibility | 2022-10-14 | Paper |
| On the unicyclic graphs having vertices that belong to all their (strong) metric bases | 2022-09-06 | Paper |
| On the outer independent double Roman domination number | 2022-09-02 | Paper |
| The total co-independent domination number of some graph operations | 2022-09-02 | Paper |
| On vertices contained in all or in no metric basis | 2022-08-04 | Paper |
| A note on the metric and edge metric dimensions of 2-connected graphs | 2022-08-04 | Paper |
| Roman domination in direct product graphs and rooted product graphs | 2022-06-03 | Paper |
| Relating the outer-independent total Roman domination number with some classical parameters of graphs | 2022-05-23 | Paper |
| Further results on packing related parameters in graphs | 2022-03-22 | Paper |
| Incidence dimension and 2-packing number in graphs | 2022-02-21 | Paper |
| The fractional k-metric dimension of graphs | 2022-02-10 | Paper |
| General d-position sets | 2021-11-30 | Paper |
| A Steiner general position problem in graph theory | 2021-11-15 | Paper |
| Graphs with the edge metric dimension smaller than the metric dimension | 2021-11-10 | Paper |
| Covering Italian domination in graphs | 2021-09-30 | Paper |
| Maker-breaker resolving game | 2021-08-12 | Paper |
| On general position sets in Cartesian products | 2021-07-16 | Paper |
| Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results | 2021-07-10 | Paper |
| Injective coloring of graphs revisited | 2021-06-17 | Paper |
| Roman domination in direct product graphs and rooted product graphs | 2021-05-20 | Paper |
| Global defensive k-alliances in directed graphs: combinatorial and computational issues | 2021-05-10 | Paper |
| Total Roman {2}-domination in graphs | 2021-04-27 | Paper |
| On the total and strong version for Roman dominating functions in graphs | 2021-04-15 | Paper |
| On three outer-independent domination related parameters in graphs | 2021-03-17 | Paper |
| On Metric Dimensions of Hypercubes | 2021-02-22 | Paper |
| (Open) packing number of some graph products | 2021-01-05 | Paper |
| Independent transversal total domination versus total domination in trees | 2020-12-08 | Paper |
| A constructive characterization of vertex cover Roman trees | 2020-12-08 | Paper |
| Constructive characterizations concerning weak Roman domination in trees | 2020-07-07 | Paper |
| Graphs with the edge metric dimension smaller than the metric dimension | 2020-06-21 | Paper |
| Further new results on strong resolving partitions for graphs | 2020-06-15 | Paper |
| Dominating the direct product of two graphs through total Roman strategies | 2020-05-27 | Paper |
| A note on total co-independent domination in trees | 2020-05-02 | Paper |
| Edge metric dimension of some graph operations | 2020-04-23 | Paper |
| Distance-based vertex identification in graphs: the outer multiset dimension | 2020-01-09 | Paper |
| The general position problem and strong resolving graphs | 2019-12-05 | Paper |
| A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers | 2019-11-08 | Paper |
| Outer-independent total Roman domination in graphs | 2019-10-09 | Paper |
| Packing and domination parameters in digraphs | 2019-10-09 | Paper |
| Quasi-total Roman domination in graphs | 2019-10-02 | Paper |
| Efficient closed domination in digraph products | 2019-06-25 | Paper |
| On the computational complexities of three problems related to a privacy measure for large networks under active attack | 2019-05-29 | Paper |
| Mixed metric dimension of graphs | 2019-04-29 | Paper |
| Computing the \(k\)-metric dimension of graphs | 2019-03-28 | Paper |
| Error-correcting codes from \(k\)-resolving sets | 2019-02-07 | Paper |
| The fractional strong metric dimension in three graph products | 2018-12-03 | Paper |
| Uniquely identifying the edges of a graph: the edge metric dimension | 2018-12-03 | Paper |
| \(k\)-metric antidimension: a privacy measure for social graphs | 2018-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4604351 | 2018-02-23 | Paper |
| Strong resolving graphs: the realization and the characterization problems | 2018-01-11 | Paper |
| Bounding the open \(k\)-monopoly number of strong product graphs | 2018-01-10 | Paper |
| On global (strong) defensive alliances in some product graphs | 2017-12-20 | Paper |
| The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity | 2017-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591109 | 2017-11-10 | Paper |
| On the strong Roman domination number of graphs | 2017-09-12 | Paper |
| On some resolving partitions for the lexicographic product of two graphs | 2017-07-28 | Paper |
| Total Roman domination in graphs | 2017-07-19 | Paper |
| Computing the (k-)monopoly number of direct product of graphs | 2017-07-19 | Paper |
| Analogies between the geodetic number and the Steiner number of some classes of graphs | 2017-07-19 | Paper |
| Independent transversal dominating sets in graphs: Complexity and structural properties | 2017-07-19 | Paper |
| Convex dominating-geodetic partitions in graphs | 2017-07-19 | Paper |
| On computational and combinatorial properties of the total co-independent domination number of graphs | 2017-05-02 | Paper |
| Graphs that are simultaneously efficient open domination and efficient closed domination graphs | 2017-03-15 | Paper |
| Open k-monopolies in graphs: complexity and related concepts | 2017-03-03 | Paper |
| Resolvability and strong resolvability in the direct product of graphs | 2017-02-22 | Paper |
| Vertices, edges, distances and metric dimension in graphs | 2017-02-14 | Paper |
| Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs | 2017-02-09 | Paper |
| Computing the metric dimension of a graph from primary subgraphs | 2017-01-23 | Paper |
| On the independence transversal total domination number of graphs | 2017-01-23 | Paper |
| Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs | 2017-01-13 | Paper |
| Closed formulae for the strong metric dimension of lexicographic product graphs | 2016-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2829057 | 2016-10-26 | Paper |
| The security number of strong grid-like graphs | 2016-10-21 | Paper |
| On the Strong Metric Dimension of Cartesian Sum Graphs | 2016-08-15 | Paper |
| Strong metric dimension of rooted product graphs | 2016-07-19 | Paper |
| The \(k\)-metric dimension of corona product graphs | 2016-07-11 | Paper |
| The k-metric dimension of graphs: a general approach | 2016-05-21 | Paper |
| The metric dimension of strong product graphs | 2016-05-18 | Paper |
| \(k\)-metric resolvability in graphs | 2016-05-13 | Paper |
| On the strong metric dimension of product graphs | 2016-05-13 | Paper |
| The \(k\)-metric dimension of the lexicographic product of graphs | 2016-04-27 | Paper |
| Domination-related parameters in rooted product graphs | 2016-03-02 | Paper |
| Strong resolving partitions for strong product graphs and Cartesian product graphs | 2016-02-12 | Paper |
| Partial product of graphs and Vizing's conjecture | 2016-01-25 | Paper |
| On the partition dimension of unicyclic graphs | 2015-11-09 | Paper |
| Roman domination in Cartesian product graphs and strong product graphs | 2015-06-26 | Paper |
| On the strong metric dimension of the strong products of graphs | 2015-02-25 | Paper |
| Erratum to ``On the strong metric dimension of the strong products of graphs | 2015-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2931510 | 2014-11-25 | Paper |
| The $k$-metric dimension of the lexicographic product of graphs | 2014-10-27 | Paper |
| On the strong partition dimension of graphs | 2014-09-04 | Paper |
| On the strong metric dimension of Cartesian and direct products of graphs | 2014-08-21 | Paper |
| The partition dimension of strong product graphs and Cartesian product graphs | 2014-08-08 | Paper |
| Resolvability and strong resolvability in the direct product of graphs | 2014-06-23 | Paper |
| Nordhaus-Gaddum results for the convex domination number of a graph | 2014-06-13 | Paper |
| Open k-monopolies in graphs: complexity and related concepts | 2014-05-02 | Paper |
| Alliance free sets in Cartesian product graphs | 2014-04-16 | Paper |
| Bondage number of grid graphs | 2014-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5401052 | 2014-03-12 | Paper |
| On the partition dimension of trees | 2014-02-18 | Paper |
| On the complexity of computing the $k$-metric dimension of graphs | 2014-01-01 | Paper |
| The k-metric dimension of a graph | 2013-12-24 | Paper |
| On Clark and Suen bound-type results fork-domination and Roman domination of Cartesian product graphs | 2013-10-08 | Paper |
| Coloring, location and domination of corona graphs | 2013-10-07 | Paper |
| Defensive alliances in graphs: a survey | 2013-08-09 | Paper |
| On the strong metric generators of strong product graphs | 2013-07-17 | Paper |
| On the strong metric dimension of corona product graphs and join graphs | 2013-04-25 | Paper |
| Partitioning a graph into global powerful \(k\)-alliances | 2012-12-27 | Paper |
| Computing global offensive alliances in Cartesian product graphs | 2012-11-22 | Paper |
| On the Randić index of corona product graphs | 2012-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118116 | 2012-03-01 | Paper |
| On the metric dimension of corona product graphs | 2011-09-18 | Paper |
| Partitioning a graph into defensive \(k\)-alliances | 2011-06-24 | Paper |
| Alliance free and alliance cover sets | 2011-04-06 | Paper |
| Partitioning a graph into offensive \(k\)-alliances | 2011-03-09 | Paper |
| A note on the partition dimension of Cartesian product graphs | 2010-12-20 | Paper |
| On global offensive \(k\)-alliances in graphs | 2010-11-05 | Paper |
| The partition dimension of corona product graphs | 2010-10-25 | Paper |
| Boundary defensive \(k\)-alliances in graphs | 2010-10-11 | Paper |
| Corrections to the article "The metric dimension of graph with pendant edges" [Journal of Combinatorial Mathematics and Combinatorial Computing, 65 (2008) 139--145] | 2010-10-08 | Paper |
| Defensive \(k\)-alliances in graphs | 2009-06-29 | Paper |
| Lower General Position Sets in Graphs | N/A | Paper |
| Mutual-visibility problems on graphs of diameter two | N/A | Paper |
