{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T01:45:15Z","timestamp":1776908715967,"version":"3.51.2"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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,12]]},"DOI":"10.1016\/0012-365x(95)00074-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"161-173","source":"Crossref","is-referenced-by-count":10,"title":["The diversity of domination"],"prefix":"10.1016","volume":"161","author":[{"given":"Michael A.","family":"Henning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ortrud R.","family":"Oellermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henda C.","family":"Swart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00074-7_BIB1","series-title":"Proc. 9th Southeastern Conf. on Graph Theory, Combinatorics and Computing, Utilitas Mathematicae","first-page":"43","article-title":"On domination and some related topics in graph theory","author":"Allan","year":"1978"},{"key":"10.1016\/0012-365X(95)00074-7_BIB2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(84)90145-6","article-title":"A note on total domination","volume":"49","author":"Allan","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00074-7_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(95)00074-7_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":"Bollob\u00e1s","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00074-7_BIB5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00074-7_BIB6","article-title":"The k-domination and k-stability problem on graphs","author":"Chang","year":"1982"},{"key":"10.1016\/0012-365X(95)00074-7_BIB7","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0012-365X(95)00074-7_BIB8","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(95)00074-7_BIB9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","article-title":"A linear algorithm for the domination number of a tree","volume":"4","author":"Cockayne","year":"1975","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0012-365X(95)00074-7_BIB10","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"},{"key":"10.1016\/0012-365X(95)00074-7_BIB11","series-title":"Applications de l'Analyse Mathematique au Ju des Echoes","author":"de Jaenisch","year":"1862"},{"key":"10.1016\/0012-365X(95)00074-7_BIB12","article-title":"Applications of linear programming duality to problems involving independence and domination","author":"Farber","year":"1981"},{"key":"10.1016\/0012-365X(95)00074-7_BIB13","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(95)00074-7_BIB14","article-title":"Generalized adjacency in graphs","author":"Henning","year":"1989"},{"key":"10.1016\/0012-365X(95)00074-7_BIB15","first-page":"11","article-title":"Bounds on distance domination parameters","volume":"16","author":"Henning","year":"1991","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0012-365X(95)00074-7_BIB16","unstructured":"M.A. Henning, O.R. Oellermann and H.C. Swart, Distance domination critical graphs. J. Combin. Inform. System Sci., to appear."},{"key":"10.1016\/0012-365X(95)00074-7_BIB17","first-page":"69","article-title":"Relationships between distance domination parameters","volume":"5","author":"Henning","year":"1994","journal-title":"Math. Pannonica"},{"key":"10.1016\/0012-365X(95)00074-7_BIB18","first-page":"233","article-title":"Relating pairs of distance domination parameters","volume":"18","author":"Henning","year":"1995","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0012-365X(95)00074-7_BIB19","first-page":"143","article-title":"Bounds on a generalized total domination parameter","volume":"6","author":"Henning","year":"1989","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0012-365X(95)00074-7_BIB20","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1080\/16073606.1990.9631615","article-title":"Bounds on a generalized domination parameter","volume":"13","author":"Henning","year":"1990","journal-title":"Quaestiones Math."},{"key":"10.1016\/0012-365X(95)00074-7_BIB21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(93)90567-D","article-title":"Bounds relating generalized domination parameters","volume":"120","author":"Henning","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00074-7_BIB22","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. Ser. A"},{"key":"10.1016\/0012-365X(95)00074-7_BIB23","article-title":"Domination in graphs and its application to social network theory","author":"Kelleher","year":"1987"},{"key":"10.1016\/0012-365X(95)00074-7_BIB24","article-title":"Planar satisfiability and its uses","author":"Lichtenstein","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00074-7_BIB25","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"},{"key":"10.1016\/0012-365X(95)00074-7_BIB26","series-title":"Theory of Graphs","author":"Ore","year":"1962"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95000747?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95000747?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:26:08Z","timestamp":1556130368000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95000747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X95000747"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00074-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}