May 1, 2017 · We say that a connected graph G is k-metric dimensional if k is the largest integer such that there exists a k-metric basis for G. We also show ...

Jan 1, 2014 · A metric generator of minimum cardinality is called a k-metric basis and its cardinality the k-metric dimension of G. We study some problems ...

Nov 1, 2015 · A connected graph G is k-metric dimensional if k is the largest integer such that there exists a k-metric basis for G.

As a generalization of the concept of metric basis, this article introduces the notion of $k$-metric basis in graphs. Given a connected graph $G=(V,E)$, ...

A metric generator of minimum cardinality is called a k-metric basis and its cardinality the k-metric dimension of G. We make a study concerning the complexity ...

This paper presents a linear programming problem that describes the problem of finding the k-metric dimension and a k- Metric basis of a graph G and ...

A metric generator of minimum cardinality is called a $k$-metric basis and its cardinality the $k$-metric dimension of $G$. We study some problems regarding the ...

A connected graph G is k-metric dimensional if k is the largest integer such that there exists a k-metric basis for G. We give a necessary and sufficient ...

Apr 30, 2024 · In this paper, the (l, k)-clique metric dimension of corona and edge corona of two graphs are computed. In addition, an integer linear ...

A connected graph G is \emph{k-metric dimensional} if k is the largest integer such that there exists a k-metric basis for G. We also show that the problem of ...