The metric dimension of a graph is the smallest number of nodes required to identify all
other nodes uniquely based on shortest path distances. Applications of metric dimension …

Treewidth serves as an important parameter that, when bounded, yields tractability for a
wide class of problems. For example, graph problems expressible in Monadic Second Order …

The edge metric dimension problem was recently introduced, which initiated the study of its
mathematical properties. The theoretical properties of the edge metric representations and …

We introduce a new graph-theoretic concept in the area of network monitoring. In this area,
one wishes to monitor the vertices and/or the edges of a network (viewed as a graph) in …

We consider the problems of finding optimal identifying codes,(open) locating-dominating
sets and resolving sets (denoted Identifying Code,(Open) Open Locating-Dominating Set …

An important dietary source of physiologically active compounds, coffee also contains
phenolic acids, diterpenes, and caffeine. According to a certain study, some coffee …

The metric dimension of a graph G is the size of a smallest subset L⊆ V (G) such that for any
x, y∈ V (G) there is az∈ L such that the graph distance between x and z differs from the …

We introduce a new graph-theoretic concept in the area of network monitoring. A set M of
vertices of a graph G is a distance-edge-monitoring set if for every edge e of G, there are a …

The metric dimension of a graph G is the smallest size of a set R of vertices that can
distinguish each vertex pair of G by the shortest-path distance to some vertex in R …

The notion of resolving sets in a graph was introduced by Slater Proceedings of the Sixth
Southeastern Conference on Combinatorics, Graph Theory, and Computing, Util. Math …