Can I read Minimum Identifying Codes in Some Graphs Differing by Matchings on EtoBox?

Minimum Identifying Codes in Some Graphs Differing by Matchings by R. Nikandish; O. Khani Nasab; E. Dodonge is a Computer Science article available to read on EtoBox.

What is Minimum Identifying Codes in Some Graphs Differing by Matchings about?

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.

Who reads Minimum Identifying Codes in Some Graphs Differing by Matchings?

Author

R. Nikandish; O. Khani Nasab; E. Dodonge

Publisher

World Scientific ; World Scientific Publishing Co. Pte Ltd; World Scientific Pub Co Pte Lt (ISSN 1793-8309)

Published

2020

Language

EN

Field

Computer Science (Physical Sciences)