TY - JOUR AU - M. Murtaza AU - I. Javaid AU - M. Fazil PY - 2020/07/15 Y2 - 2024/03/29 TI - Covering codes of a graph associated to a finite vector space JF - Ukrains’kyi Matematychnyi Zhurnal JA - Ukr. Mat. Zhurn. VL - 72 IS - 7 SE - Research articles DO - 10.37863/umzh.v72i7.652 UR - https://umj.imath.kiev.ua/index.php/umj/article/view/652 AB - UDC 512.5In 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. ER -