{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T09:31:29Z","timestamp":1768987889882,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T00:00:00Z","timestamp":1297123200000},"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,1]]},"DOI":"10.1007\/s00373-011-1028-z","type":"journal-article","created":{"date-parts":[[2011,2,7]],"date-time":"2011-02-07T08:28:51Z","timestamp":1297067331000},"page":"123-131","source":"Crossref","is-referenced-by-count":16,"title":["Connected Domination Number of a Graph and its Complement"],"prefix":"10.1007","volume":"28","author":[{"given":"H.","family":"Karami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Sheikholeslami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdollah","family":"Khodkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,8]]},"reference":[{"key":"1028_CR1","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/S0895480199353780","volume":"13","author":"Y. Caro","year":"2000","unstructured":"Caro Y., Yuster R., West D.B.: Connected domination and spanning trees. SIAM J. Discrete Math. 13, 202\u2013211 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"1028_CR2","first-page":"97","volume":"67","author":"J.E. Dunbar","year":"2005","unstructured":"Dunbar J.E., Haynes T.W., Hedetniemi S.T.: Nordhaus\u2013Gaddum bounds for domination sum in graphs with specified minimum degree. Util. Math. 67, 97\u2013105 (2005)","journal-title":"Util. Math."},{"key":"1028_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(92)90331-9","volume":"104","author":"J.R. Griggs","year":"1992","unstructured":"Griggs J.R., Wu M.: Spanning trees in graphs of minimum degree 4 or 5. Discrete Math. 104, 167\u2013183 (1992)","journal-title":"Discrete Math."},{"key":"1028_CR4","volume-title":"Graph Theory and Combinatorics (Cambridge, 1983)","author":"S.T. Hedetniemi","year":"1984","unstructured":"Hedetniemi S.T., Laskar R.C.: Connected domination in graphs. In: Bollob\u00e1s, B. (eds) Graph Theory and Combinatorics (Cambridge, 1983), pp. 209\u2013217. Academic Press, London (1984)"},{"key":"1028_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/07421222.1995.11518064","volume":"11","author":"J.P. Joseph","year":"1995","unstructured":"Joseph J.P., Arumugam S.: Domination in graphs. Internat. J. Manag. Syst. 11, 177\u2013182 (1995)","journal-title":"Internat. J. Manag. Syst."},{"key":"1028_CR6","first-page":"728","volume":"274","author":"F. Jaeger","year":"1972","unstructured":"Jaeger F., Payan C.: Relations du type Nordhais-Gaddum pour le nombre d\u2019absorption d\u2019un graphe simple. C. R. Acad. Sci. Paris S\u00e9r. A 274, 728\u2013730 (1972)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A"},{"key":"1028_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"D.J. Kleitman","year":"1991","unstructured":"Kleitman D.J., West D.B.: Spanning trees with many leaves. SIAM J. Discrete Math. 4, 99\u2013106 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"1028_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"E.A. Nordhaus","year":"1956","unstructured":"Nordhaus E.A., Gaddum J.W.: On complementary graphs. Amer. Math. Monthly 63, 175\u2013177 (1956)","journal-title":"Amer. Math. Monthly"},{"issue":"6","key":"1028_CR9","first-page":"607","volume":"13","author":"E. Sampathkumar","year":"1979","unstructured":"Sampathkumar E., Walikar H.B.: The connected domination number of a graph. J. Math. Phys. Sci. 13(6), 607\u2013613 (1979)","journal-title":"J. Math. Phys. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1028-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1028-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1028-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:32Z","timestamp":1559055512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1028-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,8]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["1028"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1028-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,8]]}}}