{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T07:10:38Z","timestamp":1726384238311},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T00:00:00Z","timestamp":1309219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00373-011-1065-7","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T00:42:34Z","timestamp":1309221754000},"page":"575-583","source":"Crossref","is-referenced-by-count":4,"title":["Partitioning a Graph into Global Powerful k-Alliances"],"prefix":"10.1007","volume":"28","author":[{"given":"Ismael G.","family":"Yero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Rodr\u00edguez-Vel\u00e1zquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,28]]},"reference":[{"key":"1065_CR1","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.1016\/j.aml.2010.08.008","volume":"23","author":"S. Bermudo","year":"2010","unstructured":"Bermudo S., Rodr\u00edguez-Vel\u00e1zquez J.A., Sigarreta J.M., Yero I.G.: On global offensive k-alliances in graphs. Appl. Math. Lett. 23, 1454\u20131458 (2010)","journal-title":"Appl. Math. Lett."},{"issue":"8","key":"1065_CR2","doi-asserted-by":"crossref","first-page":"2140","DOI":"10.1016\/j.disc.2006.10.026","volume":"309","author":"R.C. Brigham","year":"2009","unstructured":"Brigham R.C., Dutton R., Haynes T.W., Hedetniemi S.T.: Powerful alliances in graphs. Discrete Math. 309(8), 2140\u20132147 (2009)","journal-title":"Discrete Math."},{"key":"1065_CR3","first-page":"57","volume":"167","author":"R.C. Brigham","year":"2004","unstructured":"Brigham R.C., Dutton R., Hedetniemi S.: A sharp lower bound on the powerful alliance number of C m \u00d7 C n . Congr. Numer. 167, 57\u201363 (2004)","journal-title":"Congr. Numer."},{"key":"1065_CR4","unstructured":"Eroh, L., Gera, R.: Alliance partition number in graphs. Ars Combin. (2007, in press)"},{"key":"1065_CR5","first-page":"161","volume":"66","author":"L. Eroh","year":"2008","unstructured":"Eroh L., Gera R.: Global alliance partition in trees. J. Combin. Math. Combin. Comput. 66, 161\u2013169 (2008)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"2","key":"1065_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.7151\/dmgt.1230","volume":"24","author":"O. Favaron","year":"2004","unstructured":"Favaron O., Fricke G., Goddard W., Hedetniemi S., Hedetniemi S.T., Kristiansen P., Laskar R.C., Skaggs R.D.: Offensive alliances in graphs. Discuss. Math. Graph Theory 24(2), 263\u2013275 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1065_CR7","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A., Sigarreta, J.M.: Global r-alliances and total domination. In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Universit\u00e1 degli Studi di Milano, Gargnano, Italy. Abstracts 98\u2013101 (2008)"},{"issue":"1","key":"1065_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.dam.2008.06.001","volume":"157","author":"H. Fernau","year":"2009","unstructured":"Fernau H., Rodr\u00edguez J.A., Sigarreta J.M.: Offensive k-alliances in graphs. Discrete Appl. Math. 157(1), 177\u2013182 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1065_CR9","first-page":"37","volume":"38","author":"G.H. Fricke","year":"2003","unstructured":"Fricke G.H., Lawson L.M., Haynes T.W., Hedetniemi S.M., Hedetniemi S.T.: A note on defensive alliances in graphs. Bull. Inst. Combin. Appl. 38, 37\u201341 (2003)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1065_CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.37236\/1740","volume":"10","author":"T.W. Haynes","year":"2003","unstructured":"Haynes T.W., Hedetniemi S.T., Henning M.A.: Global defensive alliances in graphs. Electron. J. Combin. 10, 139\u2013146 (2003)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"1065_CR11","first-page":"51","volume":"4","author":"T.W. Haynes","year":"2007","unstructured":"Haynes T.W., Lachniet J.A.: The alliance partition number of grid graphs. AKCE Int. J. Graphs Comb. 4(1), 51\u201359 (2007)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"1065_CR12","first-page":"157","volume":"48","author":"P. Kristiansen","year":"2004","unstructured":"Kristiansen P., Hedetniemi S.M., Hedetniemi S.T.: Alliances in graphs. J. Combin. Math. Combin. Comput. 48, 157\u2013177 (2004)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1065_CR13","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.aml.2008.02.012","volume":"22","author":"J.A. Rodr\u00edguez-Vel\u00e1zquez","year":"2009","unstructured":"Rodr\u00edguez-Vel\u00e1zquez J.A., Gonz\u00e1lez-Yero I., Sigarreta J.M.: Defensive k-alliances in graphs. Appl. Math. Lett. 22, 96\u2013100 (2009)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"1065_CR14","first-page":"83","volume":"4","author":"J.A. Rodr\u00edguez","year":"2007","unstructured":"Rodr\u00edguez J.A., Sigarreta J.M.: Global alliances in planar graphs. AKCE Int. J. Graphs Comb. 4(1), 83\u201398 (2007)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"1065_CR15","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.dam.2008.02.006","volume":"157","author":"J.A. Rodr\u00edguez","year":"2009","unstructured":"Rodr\u00edguez J.A., Sigarreta J.M.: Global defensive k-alliances in graphs. Discrete Appl. Math. 157, 211\u2013218 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"36","key":"1065_CR16","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.12988\/imf.2006.06152","volume":"1","author":"J.A. Rodr\u00edguez","year":"2006","unstructured":"Rodr\u00edguez J.A., Sigarreta J.M.: Offensive alliances in cubic graphs. Int. Math. Forum 1(36), 1773\u20131782 (2006)","journal-title":"Int. Math. Forum"},{"issue":"1","key":"1065_CR17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.7151\/dmgt.1351","volume":"27","author":"J.A. Rodr\u00edguez","year":"2007","unstructured":"Rodr\u00edguez J.A., Sigarreta J.M.: Spectral study of alliances in graphs. Discuss. Math. Graph Theory 27(1), 143\u2013157 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1065_CR18","first-page":"139","volume":"56","author":"K.H. Shafique","year":"2006","unstructured":"Shafique K.H., Dutton R.D.: A tight bound on the cardinalities of maximum alliance-free and minimun alliance-cover sets. J. Combin. Math. Combin. Comput. 56, 139\u2013145 (2006)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1065_CR19","first-page":"139","volume":"162","author":"K.H. Shafique","year":"2003","unstructured":"Shafique K.H., Dutton R.D.: Maximum alliance-free and minimum alliance-cover sets. Congr. Numer. 162, 139\u2013146 (2003)","journal-title":"Congr. Numer."},{"key":"1065_CR20","first-page":"183","volume":"154","author":"K.H. Shafique","year":"2002","unstructured":"Shafique K.H., Dutton R.D.: On satisfactory partitioning of graphs. Congr. Numer. 154, 183\u2013194 (2002)","journal-title":"Congr. Numer."},{"issue":"2","key":"1065_CR21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.dam.2008.02.007","volume":"157","author":"J.M. Sigarreta","year":"2009","unstructured":"Sigarreta J.M., Rodr\u00edguez J.A.: On the global offensive alliance number of a graph. Discrete Appl. Math. 157(2), 219\u2013226 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1065_CR22","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.dam.2010.11.005","volume":"159","author":"J.M. Sigarreta","year":"2011","unstructured":"Sigarreta J.M., Yero I.G., Bermudo S., Rodr\u00edguez-Vel\u00e1zquez J.A.: Partitioning a graph into offensive k-alliances. Discrete Appl. Math. 159, 224\u2013231 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1065_CR23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10114-011-9075-1","volume":"27","author":"I.G. Yero","year":"2011","unstructured":"Yero I.G., Bermudo S., Rodr\u00edguez-Vel\u00e1zquez J.A., Sigarreta J.M.: Partitioning a graph into defensive k-alliances. Acta Math. Sin. (Engl. Ser.) 27(1), 73\u201382 (2011)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"1065_CR24","unstructured":"Yero, I.G., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Boundary powerful k-alliances in graphs. Ars Combin. (2009, in press)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1065-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1065-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1065-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T22:05:26Z","timestamp":1592690726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1065-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,28]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1065"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1065-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,28]]}}}