{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:01Z","timestamp":1759063501449},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"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":[[2003,5]]},"DOI":"10.1016\/s0012-365x(02)00806-3","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"185-193","source":"Crossref","is-referenced-by-count":3,"title":["Changing upper irredundance by edge addition"],"prefix":"10.1016","volume":"266","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":"W","family":"Goddard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.J.P","family":"Grobler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.M","family":"Mynhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00806-3_BIB1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/jgt.3190130303","article-title":"Irredundant Ramsey numbers for graphs","volume":"13","author":"Brewster","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(02)00806-3_BIB2","first-page":"57","article-title":"Changing and unchanging the domination number of a graph","volume":"9","author":"Carrington","year":"1991","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(02)00806-3_BIB3","first-page":"119","article-title":"The irredundant Ramsey number s(4,4)","volume":"41","author":"Cockayne","year":"1992","journal-title":"Utilitas Math."},{"key":"10.1016\/S0012-365X(02)00806-3_BIB4","first-page":"213","article-title":"What makes an irredundant set maximal?","volume":"25","author":"Cockayne","year":"1997","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(02)00806-3_BIB5","first-page":"65","article-title":"Sensitivity of the upper irredundance number to edge addition","volume":"33","author":"Dunbar","year":"2000","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(02)00806-3_BIB6","unstructured":"P.J.P. Grobler, Critical concepts in domination, independence and irredundance of graphs, Ph.D. Thesis, University of South Africa, 1998."},{"key":"10.1016\/S0012-365X(02)00806-3_BIB7","first-page":"239","article-title":"Upper domination parameters and edge-critical graphs","volume":"33","author":"Grobler","year":"2000","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(02)00806-3_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0012-365X(00)00319-8","article-title":"Domination parameters and edge-removal-critical graphs","volume":"231","author":"Grobler","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00806-3_BIB9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.1015","article-title":"Vertex criticality for upper domination and irredundance","volume":"37","author":"Grobler","year":"2001","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(02)00806-3_BIB10","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/S0012-365X(02)00806-3_BIB11","series-title":"Domination in Graphs: Advanced Topics","first-page":"439","article-title":"Graphs critical with respect to the domination number","author":"Sumner","year":"1998"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008063?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008063?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:54:53Z","timestamp":1553914493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0012365X02008063"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00806-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}