{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:48:51Z","timestamp":1784238531529,"version":"3.55.0"},"reference-count":38,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:00:00Z","timestamp":1614643200000},"content-version":"vor","delay-in-days":60,"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":[[2020,2,19]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>Let <jats:italic>G<\/jats:italic> = (<jats:italic>V, E<\/jats:italic>) be a simple graph. A non-empty set <jats:italic>D<\/jats:italic> \u2286 <jats:italic>V<\/jats:italic> is called a global offensive alliance if <jats:italic>D<\/jats:italic> is a dominating set and for every vertex \u03bd in <jats:italic>V \u2212 D<\/jats:italic>, |<jats:italic>N<jats:sub>G<\/jats:sub><\/jats:italic> [\u03bd] \u2229 <jats:italic>D<\/jats:italic>|\u2265|<jats:italic>N<jats:sub>G<\/jats:sub><\/jats:italic> [\u03bd] \u2212 <jats:italic>D<\/jats:italic>|. The global offensive alliance number is the minimum cardinality of a global offensive alliance in <jats:italic>G<\/jats:italic>. In this paper, we give a constructive characterization of trees having a unique minimum global offensive alliance.<\/jats:p>","DOI":"10.1051\/ro\/2020017","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T09:40:08Z","timestamp":1582191608000},"page":"S863-S872","source":"Crossref","is-referenced-by-count":2,"special_numbering":"Supplement","title":["Trees with unique minimum global offensive alliance"],"prefix":"10.1051","volume":"55","author":[{"given":"Mohamed","family":"Bouzefrane","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Isma","family":"Bouchemakh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Zamime","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noureddine","family":"Ikhlef-Eschouf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2021,3,2]]},"reference":[{"key":"R1","first-page":"23","volume":"58","author":"Balakrishnan","year":"2006","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"R2","first-page":"225","volume":"76","author":"Blidia","year":"2011","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"R3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.7494\/OpMath.2009.29.3.223","volume":"29","author":"Bouzefrane","year":"2009","journal-title":"Opuscula Math"},{"key":"R4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.7494\/OpMath.2011.31.2.153","volume":"31","author":"Bouzefrane","year":"2011","journal-title":"Opuscula Math"},{"key":"R5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.akcej.2018.01.001","volume":"15","author":"Bouzefrane","year":"2018","journal-title":"AKCE Int. J. Graphs Comb"},{"key":"R6","first-page":"245","volume":"73","author":"Chellali","year":"2010","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"R7","first-page":"3","volume":"73","author":"Chellali","year":"2004","journal-title":"Ars Combin"},{"key":"R8","first-page":"233","volume":"83","author":"Chellali","year":"2010","journal-title":"Util. Math"},{"key":"R9","doi-asserted-by":"crossref","first-page":"1450038","DOI":"10.1142\/S1793830914500384","volume":"06","author":"Chellali","year":"2014","journal-title":"Discrete Math. Algorithms Appl"},{"key":"R10","first-page":"125","volume":"47","author":"Chellali","year":"2010","journal-title":"Australas. J. Combin"},{"key":"R11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.7151\/dmgt.1230","volume":"24","author":"Favaron","year":"2004","journal-title":"Discuss. Math. Graph Theory"},{"key":"R12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.dam.2008.06.001","volume":"157","author":"Fernau","year":"2009","journal-title":"Discrete Appl. Math"},{"key":"R13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0012-365X(01)00196-0","volume":"240","author":"Fischermann","year":"2001","journal-title":"Discrete Math"},{"key":"R14","unstructured":"Fischermann M. and Triesch U.D.E., Domination parameters and their unique realizations, Ph.D. thesis. Techn. Hochsch. Bibl. (2002)."},{"key":"R15","first-page":"117","volume":"25","author":"Fischermann","year":"2002","journal-title":"Australas. J. Combin"},{"key":"R16","first-page":"229","volume":"63","author":"Fischermann","year":"2003","journal-title":"Util. Math"},{"key":"R17","first-page":"237","volume":"47","author":"Fischermann","year":"2003","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"R18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0012-365X(02)00670-2","volume":"260","author":"Fischermann","year":"2003","journal-title":"Discrete Math"},{"key":"R19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.disc.2005.08.005","volume":"305","author":"Fischermann","year":"2005","journal-title":"Discrete Math"},{"key":"R20","first-page":"91","volume":"46","author":"Fraboni","year":"2010","journal-title":"Australas. J. Combin"},{"key":"R21","unstructured":"Gunther G., Hartnell B., Markus L. and Rall D., Graphs with unique minimum dominating sets. In: Vol. 101 of Proc. 25th S.E. Int. Conf. Combin., Graph Theory, and Computing, Congr. Numer., Springer, New York, NY (1994) 55\u201363."},{"key":"R22","doi-asserted-by":"crossref","first-page":"1739","DOI":"10.1016\/j.dam.2011.11.026","volume":"161","author":"Harutyunyan","year":"2013","journal-title":"Discrete Appl. Math"},{"key":"R23","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/j.dam.2013.08.018","volume":"164","author":"Harutyunyan","year":"2014","journal-title":"Discrete Appl. Math"},{"key":"R24","doi-asserted-by":"crossref","first-page":"233","DOI":"10.7151\/dmgt.1172","volume":"22","author":"Haynes","year":"2002","journal-title":"Discuss. Math. Graph Theory"},{"key":"R25","unstructured":"Haynes T.W., Hedetniemi S.T. and Slater P.J., Fundamentals of Domination in graphs. Marcel Dekker, New York, NY (1998)."},{"key":"R26","unstructured":"Haynes T.W., Hedetniemi S.T. and Slater P.J., Domination in Graphs: Advanced Topics. Marcel Dekker, New York, NY (1998)."},{"key":"R27","doi-asserted-by":"crossref","first-page":"615","DOI":"10.7151\/dmgt.1822","volume":"34","author":"Hedetniemi","year":"2015","journal-title":"Discuss. Math. Graph Theory"},{"key":"R28","first-page":"91","volume":"62","author":"Hedetniemi","year":"2015","journal-title":"Australas. J. Combin"},{"key":"R29","first-page":"193","volume":"101","author":"Hedetniemi","year":"2017","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"R30","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0012-365X(85)90177-3","volume":"57","author":"Hopkins","year":"1985","journal-title":"Discrete Math"},{"key":"R31","first-page":"157","volume":"48","author":"Kristiansen","year":"2004","journal-title":"J. Comb. Math. Combin. Comput"},{"key":"R32","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.akcej.2017.05.002","volume":"15","author":"Ouazine","year":"2018","journal-title":"AKCE Int. J. Graphs Comb"},{"key":"R33","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.dam.2018.04.019","volume":"250","author":"Radm","year":"2018","journal-title":"Discrete Appl Math"},{"key":"R34","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.endm.2006.06.074","volume":"25","author":"Rodr\u00edguez-Vel\u00e1zquez","year":"2006","journal-title":"Electron. Notes Discrete Math"},{"key":"R35","doi-asserted-by":"crossref","first-page":"143","DOI":"10.7151\/dmgt.1351","volume":"27","author":"Rodr\u00edguez-Vel\u00e1zquez","year":"2007","journal-title":"Discuss. Math. Graph Theory"},{"key":"R36","doi-asserted-by":"crossref","unstructured":"Siemes W., Topp J. and Volkmann L., On unique independent sets in graphs. In Vol. 131 of Discrete Math. Elsevier, New York, NY (1994) 279\u2013285.","DOI":"10.1016\/0012-365X(94)90389-1"},{"key":"R37","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(93)90553-6","volume":"121","author":"Topp","year":"1993","journal-title":"Discrete Math"},{"key":"R38","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.dam.2012.08.009","volume":"161","author":"Yero","year":"2013","journal-title":"Discrete Appl. Math"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020017\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T09:33:45Z","timestamp":1614677625000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":38,"alternative-id":["ro180234"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2020017","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}