{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T03:36:19Z","timestamp":1773286579386,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":5433,"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":[[1998,9]]},"DOI":"10.1016\/s0012-365x(98)00108-3","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"207-221","source":"Crossref","is-referenced-by-count":2,"title":["Interpolation theorems for domination numbers of a graph"],"prefix":"10.1016","volume":"191","author":[{"given":"Jerzy","family":"Topp","sequence":"first","affiliation":[]},{"given":"Preben Dahl","family":"Vestergaard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00108-3_BIB1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(84)90061-X","article-title":"Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size","volume":"49","author":"Barefoot","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB2","first-page":"65","article-title":"Interpolation and related topics","volume":"12","author":"Barefoot","year":"1992","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB3","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","article-title":"The k-domination and k-stability problems on sun-free chordal graphs","volume":"5","author":"Chang","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB4","series-title":"The Theory and Applications of Graphs","first-page":"610","article-title":"Problem","author":"Chartrand","year":"1981"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB5","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB6","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\/S0012-365X(98)00108-3_BIB7","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."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB8","first-page":"259","article-title":"Generalized packings and coverings of graphs","volume":"62","author":"Domke","year":"1988"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB9","first-page":"67","article-title":"Classical perfect graphs \u2014 an introduction with emphasis on triangulated and interval graphs","volume":"21","author":"Duchet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB10","series-title":"Proc. 5th Quadrennial International Conf. on Graph Theory with Applications to Algorithms and Computer Science","first-page":"283","article-title":"On n-domination, n-dependence and forbidden subgraphs","author":"Fink","year":"1984"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/jgt.3190070302","article-title":"Maximum versus minimum invariants for graphs","volume":"7","author":"Harary","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB12","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TCS.1983.1085385","article-title":"Interpolation theorem for diameters of spanning trees","volume":"30","author":"Harary","year":"1983","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB13","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/jgt.3190130606","article-title":"Classification of interpolation theorems for spanning trees and other families of spanning subgraphs","volume":"13","author":"Harary","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB14","first-page":"215","article-title":"Interpolation theorems for invariants of spanning trees of a given graph: covering numbers","volume":"64","author":"Harary","year":"1988"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-5060(08)70462-X","article-title":"Interpolation theorems for the independence and domination numbers of spanning trees","volume":"41","author":"Harary","year":"1989","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB16","first-page":"107","article-title":"Interpolation theorems for the invariants of spanning trees of a given graph: edge-covering","volume":"59","author":"Harary","year":"1987"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90349-M","article-title":"Chordal graphs and upper irredundance, upper domination and independence","volume":"86","author":"Jacobson","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB18","first-page":"134","article-title":"A simpler proof of interpolation theorem for spanning trees","volume":"30","author":"Lin","year":"1985","journal-title":"Kexue Tongbao"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB19","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","article-title":"Relations between packing and covering numbers of a tree","volume":"61","author":"Meir","year":"1975","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB21","first-page":"377","article-title":"The global domination number of a graph","volume":"23","author":"Sampathkumar","year":"1989","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/S0012-365X(98)00108-3_BIB22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190070209","article-title":"Interpolation theorem for the number of end-vertices of spanning trees","volume":"7","author":"Schuster","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00108-3_BIB23","first-page":"99","article-title":"Domination, independence and irredundance in graphs","volume":"342","author":"Topp","year":"1995","journal-title":"Diss. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001083?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001083?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:54:06Z","timestamp":1556132046000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0012365X98001083"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00108-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}