@article{Murtaza_Javaid_Fazil_2020, title={Covering codes of a graph associated to a finite vector space}, volume={72}, url={https://umj.imath.kiev.ua/index.php/umj/article/view/652}, DOI={10.37863/umzh.v72i7.652}, abstractNote={<p>UDC 512.5</p> <p>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, <strong>44</strong>, 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.<br><br></p>}, number={7}, journal={Ukrains’kyi Matematychnyi Zhurnal}, author={Murtaza, M. and Javaid, I. and Fazil , M.}, year={2020}, month={Jul.}, pages={952-959} }