| Publication | Date of Publication | Type |
|---|
| On distance and strong metric dimension of the modular product | 2025-01-10 | Paper |
| Domination number of modular product graphs | 2025-01-09 | Paper |
| Resolving vertices of graphs with differences | 2024-07-08 | Paper |
| A new approach to b-coloring of regular graphs | 2023-11-22 | Paper |
| The Toll Walk Transit Function of a Graph: Axiomatic Characterizations and First-Order Non-definability | 2023-10-31 | Paper |
| The simultaneous fractional dimension of graph families | 2023-09-29 | Paper |
| On some metric properties of direct-co-direct product | 2023-09-11 | Paper |
| Axiomatic characterization of the toll walk function of some graph classes | 2023-08-17 | Paper |
| Distance formula for direct-co-direct product in the case of disconnected factors | 2023-04-25 | Paper |
| On b-acyclic chromatic number of a graph | 2023-02-20 | Paper |
| The total co-independent domination number of some graph operations | 2022-09-02 | Paper |
| Graphs with unique maximum packing of closed neighborhoods | 2022-07-01 | Paper |
| On b-acyclic chromatic number of a graph | 2022-06-13 | Paper |
| Roman domination in direct product graphs and rooted product graphs | 2022-06-03 | Paper |
| Geodesic transversal problem for join and lexicographic product of graphs | 2022-05-23 | Paper |
| Incidence dimension and 2-packing number in graphs | 2022-02-21 | Paper |
| A Steiner general position problem in graph theory | 2021-11-15 | Paper |
| Recognizing generalized Sierpiński graphs | 2021-05-20 | Paper |
| Roman domination in direct product graphs and rooted product graphs | 2021-05-20 | Paper |
| A note on the packing chromatic number of lexicographic products | 2021-03-25 | Paper |
| On three outer-independent domination related parameters in graphs | 2021-03-17 | Paper |
| \([1,k]\)-domination number of lexicographic products of graphs | 2021-02-16 | 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 |
| Dominating the direct product of two graphs through total Roman strategies | 2020-05-27 | Paper |
| Edge metric dimension of some graph operations | 2020-04-23 | Paper |
| The complexity of open k-monopolies in graphs for negative k | 2020-04-22 | Paper |
| A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices | 2020-04-22 | Paper |
| A characterization of graphs with disjoint total dominating sets | 2019-07-25 | Paper |
| Efficient closed domination in digraph products | 2019-06-25 | Paper |
| Wiener index of strong product of graphs | 2018-11-09 | Paper |
| The security number of lexicographic products | 2018-09-17 | Paper |
| A note on the thue chromatic number of lexicographic products of graphs | 2018-06-29 | Paper |
| The median game | 2018-05-24 | Paper |
| Cartesian products of directed graphs with loops | 2018-04-05 | Paper |
| Bounding the open \(k\)-monopoly number of strong product graphs | 2018-01-10 | Paper |
| The \(b\)-chromatic number and related topics -- a survey | 2017-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591109 | 2017-11-10 | Paper |
| Computing the (k-)monopoly number of direct product of graphs | 2017-07-19 | Paper |
| Hybrid evolutionary algorithm for the b-chromatic number | 2017-04-28 | Paper |
| Graphs that are simultaneously efficient open domination and efficient closed domination graphs | 2017-03-15 | Paper |
| On gated sets in graphs | 2017-03-09 | Paper |
| Open k-monopolies in graphs: complexity and related concepts | 2017-03-03 | Paper |
| Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph | 2017-03-03 | Paper |
| Resolvability and strong resolvability in the direct product of graphs | 2017-02-22 | Paper |
| The induced path transit function and the Pasch axiom | 2016-07-11 | Paper |
| Pre-hull number of Cartesian and strong graph products | 2016-05-30 | Paper |
| Spectra of graphs and closed distance magic labelings | 2016-04-27 | Paper |
| Group distance magic labeling of direct product of graphs | 2016-01-25 | Paper |
| The \(b\)-chromatic index of a graph | 2015-10-15 | Paper |
| Distance magic labeling and two products of graphs | 2015-09-24 | Paper |
| The \(b\)-chromatic index of direct product of graphs | 2015-07-06 | Paper |
| Toll convexity | 2015-02-18 | Paper |
| Some Steiner concepts on lexicographic products of graphs | 2014-11-28 | Paper |
| Resolvability and strong resolvability in the direct product of graphs | 2014-06-23 | Paper |
| Rainbow connection and graph products | 2014-06-16 | Paper |
| Open k-monopolies in graphs: complexity and related concepts | 2014-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5397210 | 2014-02-19 | Paper |
| Atoms and clique separators in graph products | 2013-12-19 | Paper |
| Intervals and convex sets in strong product of graphs | 2013-06-26 | Paper |
| A forbidden subgraph characterization of some graph classes using betweenness axioms | 2013-04-15 | Paper |
| Hamming dimension of a graph-the case of Sierpiński graphs | 2012-12-03 | Paper |
| Almost self-centered median and chordal graphs | 2012-11-09 | Paper |
| On the b-chromatic number of some graph products | 2012-09-17 | Paper |
| The pre-hull number and lexicographic product | 2012-07-04 | Paper |
| A note on 3-Steiner intervals and betweenness | 2012-04-13 | Paper |
| Convex sets in lexicographic products of graphs | 2012-01-24 | Paper |
| n-ary transit functions in graphs | 2011-05-09 | Paper |
| NZ-flows in strong products of graphs | 2010-11-24 | Paper |
| Steiner intervals, geodesic intervals, and betweenness | 2009-12-15 | Paper |
| Strongly distance-balanced graphs and graph products | 2009-06-17 | Paper |
| A characterization of planar partial cubes | 2009-01-28 | Paper |
| Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle | 2008-10-22 | Paper |
| Antimedian graphs | 2008-08-12 | Paper |
| Game chromatic number of Cartesian product graphs | 2008-06-05 | Paper |
| Recognizing Cartesian products in linear time | 2007-02-13 | Paper |
| Fast recognition of classes of almost-median graphs | 2007-02-13 | Paper |
| A charaterization of planar median graphs | 2006-10-16 | Paper |
| Characterizing flag graphs and incuced subgraphs of Cartesian product graphs | 2005-11-24 | Paper |
| Characterizing subgraphs of Hamming graphs | 2005-08-29 | Paper |
| On Distance and Strong Metric Dimension of the Modular Product | N/A | Paper |
| Domination number of modular product graphs | N/A | Paper |
