UDC 512.5 In this paper, we investigate the problem of covering the vertices of a graph associated to a finite vector space as introduced by Das [Commun. Algebra, 44, 3918 – 3926 (2016)], such that we can uniquely identify any vertex by examining the vertices that cover it. We use locating-dominating sets and identifying codes, which are closely related concepts for this purpose. We find the location-domination number and the identifying number of the graph and study the exchange property for locating-dominating sets and identifying codes.

中文翻译：

---

有限向量空间相关图的覆盖码

UDC 512.5 在本文中，我们研究了 Das [Commun. Algebra, 44, 3918 – 3926 (2016)]，这样我们就可以通过检查覆盖它的顶点来唯一地识别任何顶点。为此，我们使用定位支配集和识别代码，它们是密切相关的概念。我们找到了图的位置支配数和识别数，并研究了位置支配集和识别码的交换性质。