Covering codes of a graph associated to a finite vector space
Muhammad Murtaza, Imran Javaid, Muhammad Fazil · Ukrains’kyi Matematychnyi Zhurnal · 2020
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.