Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
From MaRDI portal
Publication:6282585
arXiv1701.08537MaRDI QIDQ6282585FDOQ6282585
Authors: M. Murtaza, Imran Javaid, Muhammad Fazil 
Publication date: 30 January 2017
Abstract: In this paper, we investigate the problem of covering the vertices of a graph associated to a finite vector space as introduced by Das cite{Das}, 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. These sets consist of a dominating set of graph such that every vertex is uniquely identified by its neighborhood within the dominating sets. 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.
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
This page was built for publication: Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6282585)
