Journal
DISCRETE APPLIED MATHEMATICS
Volume 155, Issue 3, Pages 356-364Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2006.06.009
Keywords
strong dimension; vertex covering number; weak and unilateral dimension of digraphs
Categories
Ask authors/readers for more resources
Let G be a connected (di)graph. A vertex omega is said to strongly resolve a pair u, nu of vertices of G if there exists some shortet U-omega) path containing nu or some shortest nu-omega; path containing u. A set W of vertices is a strong resolving set for G if every pair of vertices of G is strongly resolved by some vertex of W. The smallest cardinality of a strong resolving set for G is called the strong dimension of G. It is shown that the problem of finding the strong dimension of a connected graph can be transformed to the problem of finding the vertex covering number of a graph. Moreover, it is shown that computing this invariant is NP-hard. Related invariants for directed graphs are defined and studied. (c) 2006 Elsevier B.V. All tights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available