Resolving Sets and Semi-Resolving Sets in Finite Projective Planes

Electronic Journal Of Combinatorics

Tamás Héger¹ 

关键词: resolving set;    semi-resolving set;    metric dimension;    finite projective planes;    Szőnyi-Weiner Lemma;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In a graph $\Gamma=(V,E)$ a vertex $v$ is resolved by a vertex-set $S=\{v_1,\ldots,v_n\}$ if its (ordered) distance list with respect to $S$, $(d(v,v_1),\ldots,d(v,v_n))$, is unique. A set $A\subset V$ is resolved by $S$ if all its elements are resolved b

【 授权许可】

Others