Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5

Electronic Journal Of Combinatorics

Camino Balbuena¹ 

关键词: Identifying codes;    Locating-dominating sets;    Dominating sets;    Path covers;    Girth;    Minimum degree;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the d

【 授权许可】

Others