{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:38:08Z","timestamp":1648748288948},"reference-count":2,"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":[[2018,2]]},"abstract":"<jats:p> A signed bad function of [Formula: see text] is a function [Formula: see text] such that [Formula: see text] for every [Formula: see text] where [Formula: see text] is the closed neighborhood of [Formula: see text]. The signed bad number is [Formula: see text]. Ghameshlou et al. [A. N. Ghameshlou, A. Khodkar and S. M. Sheikholeslami, The signed bad numbers in graphs, Discrete Math. Algorithms Appl. 1 (2011) 33\u201341] proved that for any bipartite graph of order [Formula: see text], [Formula: see text]. But their proof has a gap and the bound is not correct in general. In this note, we modify their proof and show that for any bipartite graph of order [Formula: see text], [Formula: see text], and also we characterize the bipartite graphs attaining this bound. <\/jats:p>","DOI":"10.1142\/s179383091850009x","type":"journal-article","created":{"date-parts":[[2017,11,23]],"date-time":"2017-11-23T21:56:44Z","timestamp":1511474204000},"page":"1850009","source":"Crossref","is-referenced-by-count":0,"title":["A correction on the signed bad number"],"prefix":"10.1142","volume":"10","author":[{"given":"J.","family":"Amjadi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}]},{"given":"R.","family":"Khoeilar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}]},{"given":"M.","family":"Soroudi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}]}],"member":"219","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"key":"S179383091850009XBIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830911000997"},{"key":"S179383091850009XBIB002","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","edition":"2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091850009X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:11:52Z","timestamp":1565111512000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091850009X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":2,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2018,2,14]]},"published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.1142\/S179383091850009X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091850009x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}