research
∙
06/14/2023
The directed metric dimension of directed co-graphs
A vertex w resolves two vertices u and v in a directed graph G if the di...
share
research
∙
12/08/2022
On the strong metric dimension of composed graphs
Two vertices u and v of an undirected graph G are strongly resolved by a...
research
∙
11/25/2021
On the Strong Metric Dimension of directed co-graphs
Let G be a strongly connected directed graph and u,v,w∈ V(G) be three ve...
research
∙
01/28/2021
A note on the complexity of k-Metric Dimension
Two vertices u, v ∈ V of an undirected connected graph G=(V,E) are resol...
research
∙
12/22/2020
Computing Directed Steiner Path Covers
In this article we consider the Directed Steiner Path Cover problem on d...
research
∙
04/07/2019
The Fault-Tolerant Metric Dimension of Cographs
A vertex set U ⊆ V of an undirected graph G=(V,E) is a resolving set for...
research
∙
06/27/2018