Minimum identifying codes in some graphs differing by matchings
R. Nikandish, O. Khani Nasab, E. Dodonge · Discrete Mathematics Algorithms and Applications · 2020
For a vertex [Formula: see text] of a graph [Formula: see text], let [Formula: see text] be the set of [Formula: see text] with all of its neighbors in [Formula: see text]. A set [Formula: see text] of vertices is an identifying code of [Formula: see text] if the sets [Formula: see text] are nonempty and distinct for all vertices [Formula: see text] of [Formula: see text]. If [Formula: see text] admits an identifying code, then [Formula: see text] is called identifiable and the minimum cardinality of an identifying code of [Formula: see text] is denoted by [Formula: see text]. Let [Formula: see text] be two positive integers. In this paper, [Formula: see text] and [Formula: see text] are computed, where [Formula: see text] and [Formula: see text] represent the complement of a path and the complement of a cycle of order [Formula: see text], respectively. Among other results, [Formula: see text] is given, where [Formula: see text] is obtained from [Formula: see text] after deleting a maximum matching.