{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T11:51:26Z","timestamp":1781524286522,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T00:00:00Z","timestamp":1288915200000},"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":[[2011,9]]},"DOI":"10.1007\/s00373-010-0992-z","type":"journal-article","created":{"date-parts":[[2010,11,4]],"date-time":"2010-11-04T18:58:45Z","timestamp":1288897125000},"page":"755-768","source":"Crossref","is-referenced-by-count":13,"title":["On Roman, Global and Restrained Domination in Graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"V.","family":"Zverovich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Poghosyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,5]]},"reference":[{"key":"992_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon N., Spencer J.H.: The Probabilistic Method. Wiley, New York (1992)"},{"key":"992_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01787474","volume":"6","author":"N. Alon","year":"1990","unstructured":"Alon N.: Transversal numbers of uniform hypergraphs. Graphs Comb. 6, 1\u20134 (1990)","journal-title":"Graphs Comb."},{"key":"992_CR3","first-page":"3","volume":"11","author":"V.I. Arnautov","year":"1974","unstructured":"Arnautov V.I.: Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices. Prikl. Mat. i Programmirovanie 11, 3\u20138 (1974)","journal-title":"Prikl. Mat. i Programmirovanie"},{"key":"992_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(81)90253-3","volume":"33","author":"B. Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s B.: Degree sequences of random graphs. Discrete Math. 33, 1\u201319 (1981)","journal-title":"Discrete Math."},{"key":"992_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0012-365X(90)90355-L","volume":"86","author":"R.C. Brigham","year":"1990","unstructured":"Brigham R.C., Dutton R.D.: Factor domination in graphs. Discrete Math. 86, 127\u2013136 (1990)","journal-title":"Discrete Math."},{"key":"992_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"E.J. Cockayne","year":"2004","unstructured":"Cockayne E.J., Dreyer P.M. Jr, Hedetniemi S.M., Hedetniemi S.T.: On Roman domination in graphs. Discrete Math. 278, 11\u201322 (2004)","journal-title":"Discrete Math."},{"key":"992_CR7","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1016\/j.disc.2007.03.003","volume":"307","author":"P. Dankelmann","year":"2007","unstructured":"Dankelmann P., Day D., Hattingh J.H., Henning M.A., Markus L.R., Swart H.C.: On equality in an upper bound for the restrained and total domination numbers of a graph. Discrete Math. 307, 2845\u20132852 (2007)","journal-title":"Discrete Math."},{"key":"992_CR8","doi-asserted-by":"crossref","first-page":"1909","DOI":"10.1016\/j.disc.2007.04.039","volume":"308","author":"M.A. Henning","year":"2008","unstructured":"Henning M.A., Maritz J.E.: Total restrained domination in graphs with minimum degree two. Discrete Math. 308, 1909\u20131920 (2008)","journal-title":"Discrete Math."},{"key":"992_CR9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"992_CR10","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1002\/jgt.3190130610","volume":"13","author":"W. McCuaig","year":"1989","unstructured":"McCuaig W., Shepherd B.: Domination in graphs with minimum degree two. J. Graph Theory 13, 749\u2013762 (1989)","journal-title":"J. Graph Theory"},{"key":"992_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4153\/CMB-1972-008-3","volume":"15","author":"J.W. Moon","year":"1972","unstructured":"Moon J.W.: Almost all graphs have a spanning cycle. Can. Math. Bull. 15, 39\u201341 (1972)","journal-title":"Can. Math. Bull."},{"key":"992_CR12","first-page":"307","volume":"17","author":"C. Payan","year":"1975","unstructured":"Payan C.: Sur le nombre d\u2019absorption d\u2019un graphe simple. Cah. Centre \u00c9tudes Rech. Op\u00e9r. 17, 307\u2013317 (1975)","journal-title":"Cah. Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"992_CR13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B. Reed","year":"1996","unstructured":"Reed B.: Paths, stars and the number three. Comb. Probab. Comput. 5, 277\u2013295 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"992_CR14","doi-asserted-by":"crossref","first-page":"585","DOI":"10.2307\/2589113","volume":"107","author":"C.S. ReVelle","year":"2000","unstructured":"ReVelle C.S., Rosing K.E.: Defendens imperium romanum: a classical problem in military strategy. Amer. Math. Mon. 107, 585\u2013594 (2000)","journal-title":"Amer. Math. Mon."},{"key":"992_CR15","first-page":"377","volume":"23","author":"E. Sampathkumar","year":"1989","unstructured":"Sampathkumar E.: The global domination number of a graph. J. Math. Phys. Sci. 23, 377\u2013385 (1989)","journal-title":"J. Math. Phys. Sci."},{"key":"992_CR16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","volume":"281","author":"I. Stewart","year":"1999","unstructured":"Stewart I.: Defend the Roman empire. Sci. Amer. 281, 136\u2013139 (1999)","journal-title":"Sci. Amer."},{"key":"992_CR17","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J.A. Telle","year":"1997","unstructured":"Telle J.A., Proskurowski A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10, 529\u2013550 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"992_CR18","first-page":"31","volume":"16","author":"K. Weber","year":"1981","unstructured":"Weber K.: Domination number for almost every graph. Rostock. Math. Kolloq. 16, 31\u201343 (1981)","journal-title":"Rostock. Math. Kolloq."},{"key":"992_CR19","doi-asserted-by":"crossref","first-page":"R37","DOI":"10.37236\/1581","volume":"8","author":"B. Wieland","year":"2001","unstructured":"Wieland B., Godbole A.P.: On the domination number of a random graph. Electron. J. Comb. 8, R37 (2001)","journal-title":"Electron. J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0992-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0992-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0992-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T14:18:35Z","timestamp":1592057915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0992-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,5]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["992"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0992-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,5]]}}}