{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:34:36Z","timestamp":1753882476154,"version":"3.41.2"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"name":"General Directorate of Scientific Research and Technological Development of Algeria","award":["C00L03UN180120220002"],"award-info":[{"award-number":["C00L03UN180120220002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:p> A broadcast on a graph [Formula: see text] is a function [Formula: see text] such that for each [Formula: see text], where [Formula: see text] denotes the diameter of [Formula: see text] and [Formula: see text] denotes the eccentricity of [Formula: see text]. The cost of a broadcast is the value [Formula: see text]. In this paper, we define and study a new invariant of broadcasts in graphs, which is global dominating broadcast. A dominating broadcast [Formula: see text] of a graph [Formula: see text] is a global dominating broadcast if [Formula: see text] is also a dominating broadcast of [Formula: see text] the complement of [Formula: see text]. We begin by determining the global broadcast domination number of bipartite graphs, paths, cycles, grid graphs and trees. Then we establish lower and upper bounds on the global broadcast domination number of a graph. Finally, we establish relationships between the global broadcast domination number and other parameters. <\/jats:p>","DOI":"10.1142\/s1793830922500835","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T09:20:59Z","timestamp":1650273659000},"source":"Crossref","is-referenced-by-count":0,"title":["Global dominating broadcast in graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"Ibrahim","family":"Boufelgha","sequence":"first","affiliation":[{"name":"Department of Mathematics and LMAM Laboratory, University of Mohamed Seddik Ben Yahia, BP 98 Ouled Aissa 18000, Jijel, Algeria"},{"name":"University Center of Abdelhafid Boussouf, Mila, Algeria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0172-0539","authenticated-orcid":false,"given":"Moussa","family":"Ahmia","sequence":"additional","affiliation":[{"name":"Department of Mathematics and LMAM Laboratory, University of Mohamed Seddik Ben Yahia, BP 98 Ouled Aissa 18000, Jijel, Algeria"}]}],"member":"219","published-online":{"date-parts":[[2022,4,18]]},"reference":[{"issue":"4","key":"S1793830922500835BIB001","doi-asserted-by":"crossref","first-page":"1750050","DOI":"10.1142\/S1793830917500501","volume":"9","author":"Amjadi J.","year":"2007","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922500835BIB002","series-title":"Collection Universitaire de Math\u00e9matiques","volume-title":"Theory of Graphs and its Applications","author":"Berge C.","year":"1958"},{"key":"S1793830922500835BIB003","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/qam\/99904","volume":"25","author":"Carlson D. E.","year":"1967","journal-title":"Q. Appl. Math."},{"key":"S1793830922500835BIB004","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100304"},{"key":"S1793830922500835BIB005","first-page":"131","volume":"91","author":"Desormeaux W. J.","year":"2013","journal-title":"Util. Math."},{"issue":"1","key":"S1793830922500835BIB006","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.dam.2005.07.009","volume":"154","author":"Dunbar J. E.","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"S1793830922500835BIB008","first-page":"89105","volume":"42","author":"Erwin D. J.","year":"2004","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830922500835BIB009","doi-asserted-by":"publisher","DOI":"10.5937\/SPSUNP1601035G"},{"issue":"3","key":"S1793830922500835BIB010","doi-asserted-by":"crossref","first-page":"1450044","DOI":"10.1142\/S179383091450044X","volume":"6","author":"Hamid I. S.","year":"2014","journal-title":"Discrete Math. Algorithms Appl."},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793830922500835BIB011"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S1793830922500835BIB012"},{"key":"S1793830922500835BIB013","first-page":"21","volume":"51","author":"Haynes T. W.","year":"2007","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830922500835BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9135-8"},{"issue":"24","key":"S1793830922500835BIB015","doi-asserted-by":"crossref","first-page":"3267","DOI":"10.1016\/j.disc.2006.06.013","volume":"306","author":"Heggernes P.","year":"2006","journal-title":"Discrete Math."},{"key":"S1793830922500835BIB017","first-page":"377","volume":"23","author":"Sampathkumar E.","year":"1989","journal-title":"J. Math. Phys. Sci."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:02:09Z","timestamp":1677726129000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":15,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10.1142\/S1793830922500835"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500835","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,4,18]]},"article-number":"2250083"}}