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

[摘要] 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

[学科分类] 离散数学和组合数学

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