{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T11:03:30Z","timestamp":1760267010594},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010,1]]},"DOI":"10.1007\/s00373-010-0894-0","type":"journal-article","created":{"date-parts":[[2010,2,17]],"date-time":"2010-02-17T05:57:51Z","timestamp":1266386271000},"page":"77-93","source":"Crossref","is-referenced-by-count":18,"title":["Bounds on the Total Restrained Domination Number of a Graph"],"prefix":"10.1007","volume":"26","author":[{"given":"J. H.","family":"Hattingh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Jonck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. J.","family":"Joubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,18]]},"reference":[{"key":"894_CR1","volume-title":"Graphs & Digraphs","author":"G. Chartrand","year":"1996","unstructured":"Chartrand G., Lesniak L.: Graphs & Digraphs, 3rd edn. Chapman & Hall, London (1996)","edition":"3"},{"issue":"1","key":"894_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10587-005-0012-2","volume":"55","author":"X.G Chen","year":"2005","unstructured":"Chen X.G, Ma D.X., Sun L.: On total restrained domination in graphs. Czechoslov. Math. J. 55(1), 165\u2013173 (2005)","journal-title":"Czechoslov. Math. J."},{"key":"894_CR3","first-page":"91","volume":"36","author":"J. Cyman","year":"2006","unstructured":"Cyman J., Raczek J.: On the total restrained domination number of a graph, Australas. J. Comb. 36, 91\u2013100 (2006)","journal-title":"J. Comb."},{"key":"894_CR4","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. Discret. Math. 307, 2845\u20132852 (2007)","journal-title":"Discret. Math."},{"key":"894_CR5","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10898-005-8565-z","volume":"34","author":"P. Dankelmann","year":"2006","unstructured":"Dankelmann P., Hattingh J.H., Henning M.A., Swart H.C.: Trees with equal domination and restrained domination numbers. J. Glob. Optim. 34, 597\u2013607 (2006)","journal-title":"J. Glob. Optim."},{"key":"894_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0012-365X(99)00016-3","volume":"203","author":"G.S. Domke","year":"1999","unstructured":"Domke G.S., Hattingh J.H., Hedetniemi S.T., Laskar R.C., Markus L.R.: Restrained domination in graphs. Discret. Math. 203, 61\u201369 (1999)","journal-title":"Discret. Math."},{"key":"894_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(99)00036-9","volume":"211","author":"G.S. Domke","year":"2000","unstructured":"Domke G.S., Hattingh J.H., Hedetniemi S.T., Markus L.R.: Restrained domination in trees. Discret. Math. 211, 1\u20139 (2000)","journal-title":"Discret. Math."},{"key":"894_CR8","first-page":"239","volume":"35","author":"G.S. Domke","year":"2000","unstructured":"Domke G.S., Hattingh J.H., Henning M.A., Markus L.R.: Restrained domination in graphs with minimum degree two. J. Comb. Math. Comb. Comput. 35, 239\u2013254 (2000)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"894_CR9","unstructured":"Hattingh, J.H., Henning, M.A.: Restrained domination excellent trees. Ars. Comb. (2010, to appear)"},{"key":"894_CR10","doi-asserted-by":"crossref","unstructured":"Hattingh, J.H., Jonck, E., Joubert, E.J.: An upper bound for the total restrained domination number of a tree. J. Comb. Optim. (2010, to appear)","DOI":"10.1007\/s10878-008-9204-7"},{"key":"894_CR11","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.disc.2006.09.014","volume":"307","author":"J.H. Hattingh","year":"2007","unstructured":"Hattingh J.H., Jonck E., Joubert E.J., Plummer A.R.: Total restrained domination in trees. Discret. Math. 307, 1643\u20131650 (2007)","journal-title":"Discret. Math."},{"key":"894_CR12","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1016\/j.disc.2007.03.061","volume":"308","author":"J.H. Hattingh","year":"2008","unstructured":"Hattingh J.H., Jonck E., Joubert E.J., Plummer A.R.: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. Discret. Math. 308, 1080\u20131087 (2008)","journal-title":"Discret. Math."},{"key":"894_CR13","doi-asserted-by":"crossref","first-page":"2846","DOI":"10.1016\/j.dam.2009.03.010","volume":"157","author":"J.H. Hattingh","year":"2009","unstructured":"Hattingh J.H., Joubert E.J.: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree. Discret. Appl. Math. 157, 2846\u20132858 (2009)","journal-title":"Discret. Appl. Math."},{"key":"894_CR14","unstructured":"Hattingh, J.H., Plummer, A.R.: A note on restrained domination in trees. Ars. Comb. 94 (2010)"},{"key":"894_CR15","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1997","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1997)"},{"key":"894_CR16","volume-title":"Domination in Graphs: Advanced Topics","author":"T.W. Haynes","year":"1997","unstructured":"Haynes T.W., Hedetniemi S.T., Slater P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1997)"},{"key":"894_CR17","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0012-365X(99)90095-X","volume":"197\/198","author":"M.A. Henning","year":"1999","unstructured":"Henning M.A.: Graphs with large restrained domination number. Discret. Math. 197\/198, 415\u2013429 (1999)","journal-title":"Discret. Math."},{"key":"894_CR18","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. Discret. Math. 308, 1909\u20131920 (2008)","journal-title":"Discret. Math."},{"issue":"130","key":"894_CR19","first-page":"165","volume":"55","author":"B. Zelinka","year":"2005","unstructured":"Zelinka B.: Remarks on restrained and total restrained domination in graphs. Czechoslov. Math. J. 55(130), 165\u2013173 (2005)","journal-title":"Czechoslov. Math. J."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0894-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0894-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0894-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:30Z","timestamp":1559041110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0894-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["894"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0894-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}