Engineering World
E-ISSN: 2692-5079 An Open Access, Peer Reviewed Journal of Selected Publications in Engineering and Applied Sciences
Volume 2, 2020
Optimal Identifying Codes in Oriented Paths and Circuits
Authors: ,
Abstract: Identifying codes in graphs are related to the classical notion of dominating sets [1]. Since there first introduction in 1998 [2], they have been widely studied and extended to several application, such as: detection of faulty processor in multiprocessor systems, locating danger or threats in sensor networks. Let G=(V,E) an unoriented connected graph. The minimum identifying code in graphs is the smallest subset of vertices C, such that every vertex in V have a unique set of neighbors in C. In our work, we focus on finding minimum cardinality of an identifying code in oriented paths and circuits.