A new lower bound for doubly metric dimension and related extremal differences
Combinatorics
2023-10-11 v1
Abstract
In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars, complete graphs and complete bipartite graph are obtained. The paper analyzes some tight bounds for the new invariant in general case. Also several extremal differences between some related invariants are determined.
Keywords
Cite
@article{arxiv.2310.06071,
title = {A new lower bound for doubly metric dimension and related extremal differences},
author = {Jozef Kratica and Vera Kovačević-Vujčić and Mirjana Čangalović},
journal= {arXiv preprint arXiv:2310.06071},
year = {2023}
}