{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:49:39Z","timestamp":1757540979165},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01788145","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T07:32:29Z","timestamp":1119166349000},"page":"205-208","source":"Crossref","is-referenced-by-count":15,"title":["What is the difference between the domination and independent domination numbers of a cubic graph?"],"prefix":"10.1007","volume":"7","author":[{"given":"Curtiss","family":"Barefoot","sequence":"first","affiliation":[]},{"given":"Frank","family":"Harary","sequence":"additional","affiliation":[]},{"given":"Kathryn F.","family":"Jones","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01788145_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","volume":"23","author":"R.B. Allan","year":"1978","unstructured":"Allan, R.B., Laskar, R.: On domination and independent domination numbers of a graph. Discrete Math.23, 73\u201376 (1978)","journal-title":"Discrete Math."},{"key":"BF01788145_CR2","volume-title":"Theory of Graphs and Its Applications","author":"C. Berge","year":"1962","unstructured":"Berge, C.: Theory of Graphs and Its Applications. London: Methuen 1962"},{"key":"BF01788145_CR3","first-page":"471","volume":"10","author":"E.J. Cockayne","year":"1974","unstructured":"Cockayne, E.J., Hedetniemi, S.T.: Independence graphs. Congr. Numerantium10, 471\u2013491 (1974)","journal-title":"Congr. Numerantium"},{"key":"BF01788145_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"E.J. Cockayne","year":"1977","unstructured":"Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks7, 247\u2013261 (1977)","journal-title":"Networks"},{"key":"BF01788145_CR5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Reading: Addison-Wesley 1969"},{"key":"BF01788145_CR6","first-page":"149","volume-title":"Studies in Graph Theory","author":"F. Harary","year":"1989","unstructured":"Harary, F., Livingston, M.: The caterpillars with equal domination and independent domination numbers. Studies in Graph Theory, V.R. Kulli, ed., Vishwa, India: Gulbarga 149\u2013154 (1989)"},{"key":"BF01788145_CR7","first-page":"121","volume":"55","author":"F. Harary","year":"1986","unstructured":"Harary, F., Livingston, M.: Characterization of trees with equal domination and independent domination numbers, Congr. Numerantium55, 121\u2013150 (1986)","journal-title":"Congr. Numerantium"},{"key":"BF01788145_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/nav.3800060406","volume":"6","author":"F. Harary","year":"1959","unstructured":"Harary, F., Richardson, M.: A matrix algorithm for solutions andr-bases of a finite irreflexive relation, Nav. Res. Logist. Q.6, 307\u2013314 (1959)","journal-title":"Nav. Res. Logist. Q."},{"key":"BF01788145_CR9","first-page":"489","volume":"19","author":"S. Mitchell","year":"1977","unstructured":"Mitchell, S., Hedetniemi, S.: Independent domination in trees. Congr. Numerantium19, 489\u2013510 (1977)","journal-title":"Congr. Numerantium"},{"key":"BF01788145_CR10","volume-title":"On the difference between the domination and independent domination numbers of cubic graphs. Theory of Graphs and Applications","author":"C. Mynhardt","year":"1991","unstructured":"Mynhardt, C.: On the difference between the domination and independent domination numbers of cubic graphs. Theory of Graphs and Applications, New York: Wiley 1991 (to appear)"},{"key":"BF01788145_CR11","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"O. Ore","year":"1962","unstructured":"Ore, O.: Theory of Graphs. Amer. Math. Soc., Providence (1962)"},{"key":"BF01788145_CR12","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann von","year":"1953","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton: Princeton University Press 1953"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788145.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788145\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T09:12:23Z","timestamp":1557479543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01788145"],"URL":"https:\/\/doi.org\/10.1007\/bf01788145","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}