{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T15:33:53Z","timestamp":1687880033314},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p> The binding number of a graph G is defined to be the minimum of [Formula: see text] taken over all nonempty [Formula: see text] such that [Formula: see text]. Binding number, one indicator to better understand graph, is an important characteristic quantity of a graph. In this paper, the relationships between the binding number and some other graph vulnerability parameters, namely the toughness, integrity, rupture degree and scattering number, are established. Exact values for the binding numbers of wheel related graphs namely gear, helm, sunflower and friendship graph are obtained. <\/jats:p>","DOI":"10.1142\/s0129054117500034","type":"journal-article","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T06:21:41Z","timestamp":1490163701000},"page":"29-38","source":"Crossref","is-referenced-by-count":7,"title":["Binding Number and Wheel Related Graphs"],"prefix":"10.1142","volume":"28","author":[{"given":"Vecdi","family":"Ayta\u00e7","sequence":"first","affiliation":[{"name":"Computer Engineering Department, Faculty of Engineering, Ege University, Bornova, \u0130ZM\u0130R, 35100, Turkey"}]},{"given":"Zeynep Nihan","family":"Berberler","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Science, Dokuz Eyl\u00fcl University, Buca, \u0130ZM\u0130R, 35160, Turkey"}]}],"member":"219","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"issue":"15","key":"p_1","first-page":"11","volume":"5","author":"S.","year":"2008","journal-title":"University of Sharjah Journal of Pure & Applied Sciences"},{"key":"p_2","first-page":"13","volume":"1","author":"Barefoot C. A.","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90138-6"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90072-K"},{"key":"p_7","first-page":"6","volume":"15","author":"Gallian J. A.","year":"2008","journal-title":"Electron. J. Combin."},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90013-8"},{"key":"p_10","first-page":"290","author":"Kane V. G.","year":"1981","journal-title":"Berlin-New York"},{"key":"p_11","first-page":"201","volume":"11","author":"Kane V. G.","year":"1981","journal-title":"Ars Combin."},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1080\/00207160412331336062"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.06.014"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1080\/00207160601084547"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(73)90038-5"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054117500034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:43:27Z","timestamp":1565145807000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054117500034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2017,3,21]]},"published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1142\/S0129054117500034"],"URL":"https:\/\/doi.org\/10.1142\/s0129054117500034","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}