{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:44:24Z","timestamp":1677728664031},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s1793830920500469","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T03:11:26Z","timestamp":1585019486000},"page":"2050046","source":"Crossref","is-referenced-by-count":1,"title":["Minimum identifying codes in some graphs differing by matchings"],"prefix":"10.1142","volume":"12","author":[{"given":"R.","family":"Nikandish","sequence":"first","affiliation":[{"name":"Department of Mathematics, Jundi-Shapur University of Technology, Dezful, Iran"}]},{"given":"O.","family":"Khani Nasab","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Jundi-Shapur University of Technology, Dezful, Iran"}]},{"given":"E.","family":"Dodonge","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Jundi-Shapur University of Technology, Dezful, Iran"}]}],"member":"219","published-online":{"date-parts":[[2020,5,7]]},"reference":[{"key":"S1793830920500469BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2009.07.097"},{"key":"S1793830920500469BIB002","doi-asserted-by":"publisher","DOI":"10.37236\/4562"},{"key":"S1793830920500469BIB003","volume-title":"Graphes","author":"Berge C.","year":"1983"},{"key":"S1793830920500469BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2003.12.013"},{"key":"S1793830920500469BIB005","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2015.9.129"},{"key":"S1793830920500469BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-012-0078-2"},{"key":"S1793830920500469BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.09.027"},{"key":"S1793830920500469BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/18.661507"},{"key":"S1793830920500469BIB009","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500070"},{"key":"S1793830920500469BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.03.011"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T10:49:08Z","timestamp":1594205348000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,7]]},"references-count":10,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S1793830920500469"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500469","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,7]]}}}