{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:11:20Z","timestamp":1758823880311,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s12190-020-01482-w","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T14:03:16Z","timestamp":1610978596000},"page":"507-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the watching number of graphs using discharging procedure"],"prefix":"10.1007","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5623-9932","authenticated-orcid":false,"given":"Modjtaba","family":"Ghorbani","sequence":"first","affiliation":[]},{"given":"Sheyda","family":"Maddah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"key":"1482_CR1","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I Charon","year":"2003","unstructured":"Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290, 2109\u20132120 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"1482_CR2","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inform. Theory 44, 599\u2013611 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1482_CR3","doi-asserted-by":"publisher","first-page":"1750007","DOI":"10.1142\/S1793830917500070","volume":"9","author":"M Roozbayani","year":"2016","unstructured":"Roozbayani, M., Maimani, H.R.: Identifying codes and watching systems in Kneser graphs. Discrete Math. Algorithms Appl. 9, 1750007 (2016)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"1482_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00373-011-1124-0","volume":"29","author":"D Auger","year":"2012","unstructured":"Auger, D., Charon, I.: Watching systems in the king grid. Graphs Combin. 29, 333\u2013347 (2012)","journal-title":"Graphs Combin."},{"key":"1482_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1049\/ip-d.1988.0011","volume":"135","author":"AM Davidson","year":"1988","unstructured":"Davidson, A.M., Walters, I.R.: Linear system reduction using approximate moment watching. Proc. IEEE 135, 73\u201378 (1988)","journal-title":"Proc. IEEE"},{"key":"1482_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.dam.2012.08.028","volume":"164","author":"D Auger","year":"2014","unstructured":"Auger, D., Charon, I., Hudry, O., Lobstein, A.: Maximum size of a minimum watching system and the graphs achieving the bound. Discrete Appl. Math. 164, 20\u201333 (2014)","journal-title":"Discrete Appl. Math."},{"key":"1482_CR7","first-page":"51","volume":"3","author":"M Roozbayani","year":"2014","unstructured":"Roozbayani, M., Maimani, H.R., Tehranian, A.: Watching systems of triangular graphs. Trans. Comb. 3, 51\u201357 (2014)","journal-title":"Trans. Comb."},{"key":"1482_CR8","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1016\/j.dam.2011.04.025","volume":"161","author":"D Auger","year":"2013","unstructured":"Auger, D., Charon, I., Hurdy, O., Lobstein, A.: Watching systems in graphs: an extension of identifying codes. Discrete Appl. Math. 161, 1674\u20131685 (2013)","journal-title":"Discrete Appl. Math."},{"key":"1482_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02896459","volume":"22","author":"B Zmazek","year":"2006","unstructured":"Zmazek, B., Zerovnik, J.: On domination numbers of graph bundles. J. Appl. Math. Comput. 22, 39 (2006). https:\/\/doi.org\/10.1007\/BF02896459","journal-title":"J. Appl. Math. Comput."},{"key":"1482_CR10","volume-title":"Double vertex-edge domination in graphs: complexity and algorithms","author":"H Naresh Kumar","year":"2020","unstructured":"Naresh Kumar, H., Pradhan, D., Venkatakrishnan, Y.B.: Double vertex-edge domination in graphs: complexity and algorithms. J. Appl. Math, Comput (2020)"},{"key":"1482_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s12190-020-01345-4","volume":"64","author":"C Padamutham","year":"2020","unstructured":"Padamutham, C., Palagiri, V.S.R.: Algorithmic aspects of Roman domination in graphs. J. Appl. Math. Comput. 64, 89\u2013102 (2020). https:\/\/doi.org\/10.1007\/s12190-020-01345-4","journal-title":"J. Appl. Math. Comput."},{"key":"1482_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.5614\/ejgta.2017.5.2.1","volume":"5","author":"V Yegnanarayanan","year":"2017","unstructured":"Yegnanarayanan, V.: On some aspects of the generalized Petersen graph. Electron. J. Graph Theory Appl. 5, 163\u2013178 (2017)","journal-title":"Electron. J. Graph Theory Appl."},{"key":"1482_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125302","author":"M Ghorbani","year":"2020","unstructured":"Ghorbani, M., Dehmer, M., Maimani, H.R., Maddah, S., Roozbayani, M., Emmert-Streib, F.: The watching system as a generalization of identifying code. Appl. Math. Comput. (2020). https:\/\/doi.org\/10.1016\/j.amc.2020.125302","journal-title":"Appl. Math. Comput."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01482-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-020-01482-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01482-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T16:13:13Z","timestamp":1631203993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-020-01482-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["1482"],"URL":"https:\/\/doi.org\/10.1007\/s12190-020-01482-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2021,1,18]]},"assertion":[{"value":"5 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}