{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T13:06:01Z","timestamp":1707829561809},"reference-count":14,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,12,9]]},"published-print":{"date-parts":[[2019,10]]},"abstract":"The global center is a newly proposed graph concept. For a graph G<\/jats:italic>\u00a0=\u00a0(V<\/jats:italic>(G<\/jats:italic>), E<\/jats:italic>(G<\/jats:italic>)), a set S<\/jats:italic>\u00a0\u2286\u00a0V<\/jats:italic>(G<\/jats:italic>) is a global distribution center<\/jats:italic> if every vertex v<\/jats:italic>\u00a0\u2208\u00a0V<\/jats:italic>(G<\/jats:italic>)\\S<\/jats:italic> is adjacent to a vertex u<\/jats:italic>\u00a0\u2208\u00a0S<\/jats:italic> with |N<\/jats:italic>[u<\/jats:italic>]\u00a0\u2229\u00a0S<\/jats:italic>|\u00a0\u2265\u00a0|N<\/jats:italic>[v<\/jats:italic>]\u00a0\u2229\u00a0(V<\/jats:italic>(G<\/jats:italic>)\\S<\/jats:italic>)|, where N<\/jats:italic>(v<\/jats:italic>)\u00a0=\u00a0{u<\/jats:italic>\u00a0\u2208\u00a0V<\/jats:italic>(G<\/jats:italic>)|uv<\/jats:italic>\u00a0\u2208\u00a0E<\/jats:italic>(G<\/jats:italic>)} and N<\/jats:italic>[v<\/jats:italic>]\u00a0=\u00a0N<\/jats:italic>(v<\/jats:italic>)\u00a0\u222a\u00a0{v<\/jats:italic>}. The global distribution center number of a graph G<\/jats:italic> is the minimum cardinality of a global distribution center of G<\/jats:italic>. In this paper, we investigate the global distribution center number for special families of graphs. Furthermore, we develop a polynomial time heuristic algorithm to find the set of the global distribution center for general graphs.<\/jats:p>","DOI":"10.1051\/ro\/2018119","type":"journal-article","created":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T09:26:33Z","timestamp":1544520393000},"page":"1217-1227","source":"Crossref","is-referenced-by-count":2,"title":["Global distribution center number of some graphs and an algorithm"],"prefix":"10.1051","volume":"53","author":[{"given":"Rafet","family":"Durgut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Kutucu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tufan","family":"Turaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,7,29]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1142\/S0129054117500277","volume":"28","author":"Aytac","year":"2017","journal-title":"Int. J. Found. Comput. Sci."},{"key":"R2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1142\/S0129054117500034","volume":"28","author":"Aytac","year":"2017","journal-title":"Int. J. Found. Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0166-218X(92)90122-Q","volume":"37\u201338","author":"Bagga","year":"1992","journal-title":"Disc. Appl. Math."},{"key":"R4","first-page":"3","volume":"135","author":"Berberler","year":"2017","journal-title":"Ars Comb."},{"key":"R5","unstructured":"Cormen T., Leiserson C.E. and Rivest R.L., Introduction to Algorithms, 4th edition. The MIT Press, Cambridge (1990)."},{"key":"R6","first-page":"605","volume":"66","author":"Cygan","year":"2011","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"R7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.dam.2018.02.009","volume":"243","author":"Desormeaux","year":"2018","journal-title":"Disc. Appl. Math."},{"key":"R8","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TCOM.1970.1090419","volume":"18","author":"Frank","year":"1970","journal-title":"IEEE Trans. Commun. Technol."},{"key":"R9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(79)90132-8","volume":"28","author":"Grossman","year":"1979","journal-title":"Disc. Math."},{"key":"R10","first-page":"31","volume":"63","author":"Gutman","year":"1998","journal-title":"Publ. Linstitut Math. Nouv. Ser."},{"key":"R11","unstructured":"Haynes T.W., Hedetniemi S.T. and Slater P.J., Fundementals of domination in graphs. Advanced Topic, Marcel Dekker, Inc, New York, NY (1998)."},{"key":"R12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.cnsns.2010.03.018","volume":"16","author":"Mishkovski","year":"2011","journal-title":"Commun. Nonlinear Sci. Numer. Simulat."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.9734\/BJMCS\/2016\/21768","volume":"13","author":"Modha","year":"2016","journal-title":"Br. J. Math. Comput. Sci."},{"key":"R14","first-page":"451","volume":"34","author":"Nazeer","year":"2016","journal-title":"J. Appl. Math. Inf."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018119\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:25:06Z","timestamp":1584689106000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,29]]},"references-count":14,"journal-issue":{"issue":"4"},"alternative-id":["ro180214"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018119","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,29]]}}}