Open AccessCovering codes of a graph associated to a finite vector space
Author(s) -
Muhammad Murtaza,
Imran Javaid,
Muhammad Fazil
Publication year - 2020
Publication title -
ukraïnsʹkij matematičnij žurnal
Language(s) - English
Resource type - Journals
ISSN - 1027-3190
DOI - 10.37863/umzh.v72i7.652
Subject(s) - combinatorics , vertex (graph theory) , mathematics , vector space , discrete mathematics , graph , property (philosophy) , pure mathematics , philosophy , epistemology
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.