{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:27:28Z","timestamp":1778689648443,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T00:00:00Z","timestamp":1344643200000},"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":[[2013,9]]},"DOI":"10.1007\/s00373-012-1214-7","type":"journal-article","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T10:40:11Z","timestamp":1344595211000},"page":"1417-1427","source":"Crossref","is-referenced-by-count":7,"title":["A Study of Monopolies in Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"K.","family":"Khoshkhah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Nemati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Soltani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zaker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,11]]},"reference":[{"key":"1214_CR1","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0166-218X(02)00241-X","volume":"127","author":"J.-C. Bermond","year":"2003","unstructured":"Bermond J.-C., Bond J., Peleg D., Perennes S.: The power of small coalitions in graphs. Discrete Appl. Math. 127, 399\u2013414 (2003)","journal-title":"Discrete Appl. Math."},{"key":"1214_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2008","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"key":"1214_CR3","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"P.A. Dreyer","year":"2009","unstructured":"Dreyer P.A., Roberts F.S: Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl. Math 157, 1615\u20131627 (2009)","journal-title":"Discrete Appl. Math"},{"key":"1214_CR4","doi-asserted-by":"crossref","unstructured":"Favaron, O.: Global alliances and independent domination in some classes of graphs. Electron. J. Combin. 15 (2008) #R123","DOI":"10.37236\/847"},{"issue":"2","key":"1214_CR5","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.M., 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":"1214_CR6","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., Rodriguez J.A., Sigarreta J.M: Offensive r-alliances in graphs. Discrete Appl. Math. 157, 177\u2013182 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1214_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S1570-8667(03)00022-4","volume":"1","author":"P. Flocchini","year":"2003","unstructured":"Flocchini P., Kralovic R., Roncato A., Ruzicka P., Santoro N: On time versus size for monotone dynamic monopolies in regular topologies. J. Discrete Algorithms 1, 129\u2013150 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"1214_CR8","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":"1214_CR9","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North Holland, Amsterdam (1986)"},{"key":"1214_CR10","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1016\/j.disc.2005.06.036","volume":"306","author":"A. Mishra","year":"2006","unstructured":"Mishra A., Rao S.B: Minimum monopoly in regular and tree graphs. Discrete Math. 306, 1586\u20131594 (2006)","journal-title":"Discrete Math."},{"key":"1214_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D. Peleg","year":"2002","unstructured":"Peleg D.: Local majorities, coalitions and monopolies in graphs. Theoret. Comput. Sci. 282, 231\u2013257 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"36","key":"1214_CR12","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.12988\/imf.2006.06152","volume":"1","author":"J.A. Rodriguez","year":"2006","unstructured":"Rodriguez J.A., Sigarreta J.M: Offensive alliances in cubic graphs. Int. Math. Forum 1(36), 1773\u20131782 (2006)","journal-title":"Int. Math. Forum"},{"key":"1214_CR13","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., Rodriguez J.A: On the global offensive alliance number of a graph. Discrete Appl. Math. 157, 219\u2013226 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1214_CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.disc.2010.10.016","volume":"311","author":"M. Zaker","year":"2011","unstructured":"Zaker M.: Bounds for chromatic number in terms of even-girth and booksize. Discrete Math. 311, 197\u2013204 (2011)","journal-title":"Discrete Math."},{"key":"1214_CR15","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.disc.2011.11.038","volume":"312","author":"M. Zaker","year":"2012","unstructured":"Zaker M.: On dynamic monopolies of graphs with general thresholds. Discrete Math. 312, 1136\u20131143 (2012)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1214-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1214-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1214-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T12:42:56Z","timestamp":1594557776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1214-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,11]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1214"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1214-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,11]]}}}