Bounds for Identifying Codes in Terms of Degree Parameters

[摘要] An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If $\gamma^{\text{ID}}(G)$ denotes the minimum size of an identifying code of a graph $G$, it was conject

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