{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:19:59Z","timestamp":1758824399213},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p> Identifying code in graph [Formula: see text] is a subset [Formula: see text] of [Formula: see text] such that [Formula: see text] for every [Formula: see text] of [Formula: see text] and [Formula: see text] for every [Formula: see text] of [Formula: see text]. The minimum size of identifying codes of graph [Formula: see text] is denoted by [Formula: see text]. A watching system in a graph [Formula: see text] is a set [Formula: see text], where [Formula: see text] and [Formula: see text] is a subset of closed neighborhood of [Formula: see text] such that the sets [Formula: see text] are nonempty and distinct, for any [Formula: see text]. The minimum size of a watching system of [Formula: see text] is denoted by [Formula: see text]. In this paper, we show if [Formula: see text], then [Formula: see text] if [Formula: see text] (mod 3) and [Formula: see text] if [Formula: see text] (mod 3). Also we show that [Formula: see text]. This means that in this family of graphs the watching system is more efficient than identifying code. <\/jats:p>","DOI":"10.1142\/s1793830917500070","type":"journal-article","created":{"date-parts":[[2016,11,22]],"date-time":"2016-11-22T21:57:16Z","timestamp":1479851836000},"page":"1750007","source":"Crossref","is-referenced-by-count":4,"title":["Identifying codes and watching systems in Kneser graphs"],"prefix":"10.1142","volume":"09","author":[{"given":"Maryam","family":"Roozbayani","sequence":"first","affiliation":[{"name":"Department of Mathematics, Science and Research Branch, Islamic, Azad University, Tehran, Iran"}]},{"given":"Hamid Reza","family":"Maimani","sequence":"additional","affiliation":[{"name":"Mathematics Section, Department of Basic Sciences, Shahid Rajaee Teacher Training University, P. O. Box 16785-163, Tehran, Iran"},{"name":"School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P. O. Box 19395-5746, Tehran, Iran"}]}],"member":"219","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"key":"S1793830917500070BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2009.11.012"},{"key":"S1793830917500070BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.04.025"},{"key":"S1793830917500070BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00536-4"},{"key":"S1793830917500070BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.09.027"},{"key":"S1793830917500070BIB005","volume-title":"Graph Theory","author":"Diestel R.","year":"1997"},{"key":"S1793830917500070BIB006","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21686"},{"key":"S1793830917500070BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.01.002"},{"key":"S1793830917500070BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.02.009"},{"key":"S1793830917500070BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/18.661507"},{"issue":"1","key":"S1793830917500070BIB010","first-page":"51","volume":"3","author":"Roozbayani M.","year":"2014","journal-title":"Trans. Combin."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:04:57Z","timestamp":1565082297000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2017,2,6]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1142\/S1793830917500070"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500070","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}