{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:05:13Z","timestamp":1777539913446,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0012-365x(94)00373-q","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"99-105","source":"Crossref","is-referenced-by-count":51,"title":["Nordhaus-Gaddum inequalities for domination in graphs"],"prefix":"10.1016","volume":"155","author":[{"given":"Frank","family":"Harary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teresa W.","family":"Haynes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00373-Q_BIB1","unstructured":"B. Bollob\u00e1s and E.J. Cockayne, unpublished."},{"key":"10.1016\/0012-365X(94)00373-Q_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230180304","article-title":"Vertex domination-critical graphs","volume":"18","author":"Brigham","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","article-title":"Total domination in graphs","volume":"10","author":"Cockayne","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Toward a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB5","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB6","unstructured":"F. Harary and T.W. Haynes, Double domination in graphs, submitted."},{"key":"10.1016\/0012-365X(94)00373-Q_BIB7","series-title":"Graph Theory and Combinatorics","first-page":"209","article-title":"Connected domination in graphs","author":"Hedetniemi","year":"1984"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","article-title":"Bibliography on domination in graphs and some basic definitions of domination parameters","volume":"86","author":"Hedetniemi","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00373-Q_BIB9","first-page":"728","article-title":"Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphe simple","volume":"274","author":"Jaeger","year":"1972","journal-title":"C.R. Acad. Sci. Paris A"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB10","unstructured":"J.P. Joseph and S. Arumugam, A note on domination in graphs, Internat. J. Management Systems, to appear."},{"key":"10.1016\/0012-365X(94)00373-Q_BIB11","first-page":"291","article-title":"Vertex and edge domination parameters in graphs","volume":"48","author":"Laskar","year":"1985"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB12","first-page":"308","article-title":"On domination related concepts in graph theory","volume":"885","author":"Laskar","year":"1981"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Amer. Math. Monthly"},{"issue":"6","key":"10.1016\/0012-365X(94)00373-Q_BIB14","first-page":"607","article-title":"The connected domination number of a graph","volume":"13","author":"Sampathkumar","year":"1979","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/0012-365X(94)00373-Q_BIB15","first-page":"1053","article-title":"Edge dominating numbers of complementary graphs","volume":"Vol. 2","author":"Schuster","year":"1991"},{"key":"10.1016\/0012-365X(94)00373-Q_BIB16","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400373Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400373Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:20:11Z","timestamp":1556652011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400373Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0012365X9400373Q"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00373-q","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}