{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:49:12Z","timestamp":1771879752894,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"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":[[1981]]},"DOI":"10.1016\/0012-365x(81)90268-5","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"249-258","source":"Crossref","is-referenced-by-count":87,"title":["Contributions to the theory of domination, independence and irredundance in graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"E.J.","family":"Cockayne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Favaron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Payan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.G.","family":"Thomason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0012-365X(81)90268-5_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","article-title":"On domination and independent domination numbers of a graph","volume":"23","author":"Allan","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(81)90268-5_BIB2","first-page":"43","article-title":"On domination and sorr e related topics in graph theory","author":"Allan","year":"1979","journal-title":"Proc. of 9th S.E. Conference on Combinatorics, Graph Theory and Computing, Utilitas Math."},{"key":"10.1016\/0012-365X(81)90268-5_BIB3","series-title":"Theory of Graphs and its Applications","author":"Berge","year":"1962"},{"key":"10.1016\/0012-365X(81)90268-5_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph theoretic parameters concerning domination, independence and irredundance","volume":"3","author":"Bollov\u00e1s","year":"1979","journal-title":"J. of Graph Theory"},{"key":"10.1016\/0012-365X(81)90268-5_BIB5","series-title":"Theory and Applications of Graphs in America's Bicentennial Year","article-title":"Domination in undirected graphs\u2014a survey","author":"Cockayne","year":"1978"},{"key":"10.1016\/0012-365X(81)90268-5_BIB6","first-page":"471","article-title":"Independence graphs","author":"Cockayne","year":"1974","journal-title":"Proc. of 5th S.E. Conference on Combinatorics, Graph Theory and Computing, Utilitas Math."},{"key":"10.1016\/0012-365X(81)90268-5_BIB7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"issue":"4","key":"10.1016\/0012-365X(81)90268-5_BIB8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.4153\/CMB-1978-079-5","article-title":"Properties of hereditary hypergraphs and middle graphs","volume":"21","author":"Cockayne","year":"1978","journal-title":"Canad. Math. Bull."},{"issue":"3","key":"10.1016\/0012-365X(81)90268-5_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(79)90030-X","article-title":"On the sum of cardinalities of extremum maximal independent sets","volume":"26","author":"Holyer","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(81)90268-5_BIB10","first-page":"726","article-title":"Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphs simple","volume":"274","author":"Jaeger","year":"1972","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(81)90268-5_BIB11","article-title":"Theory of Graphs","volume":"38","author":"Ore","year":"1962"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902685?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902685?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T08:21:49Z","timestamp":1554884509000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81902685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81902685"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90268-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}