{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:18:56Z","timestamp":1769915936091,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T00:00:00Z","timestamp":1296604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9389-z","type":"journal-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T16:32:12Z","timestamp":1296577932000},"page":"339-346","source":"Crossref","is-referenced-by-count":14,"title":["k-tuple total domination in cross products of graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Michael A.","family":"Henning","sequence":"first","affiliation":[]},{"given":"Adel P.","family":"Kazemi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,2]]},"reference":[{"key":"9389_CR1","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1016\/j.disc.2007.04.034","volume":"308","author":"M El-Zahar","year":"2008","unstructured":"El-Zahar M, Gravier S, Klobucar A (2008) On the total domination number of cross products of graphs. Discrete Math 308:2025\u20132029","journal-title":"Discrete Math"},{"key":"9389_CR2","doi-asserted-by":"crossref","first-page":"2473","DOI":"10.1016\/j.disc.2008.05.030","volume":"309","author":"AP Burger","year":"2009","unstructured":"Burger AP, Henning MA, van Vuuren JH (2009) On the ratios between packing and domination parameters of a graph. Discrete Math 309:2473\u20132478","journal-title":"Discrete Math"},{"key":"9389_CR3","first-page":"201","volume":"55","author":"F Harary","year":"2000","unstructured":"Harary F, Haynes TW (2000) Double domination in graphs. Ars Comb 55:201\u2013213","journal-title":"Ars Comb"},{"key":"9389_CR4","volume-title":"Fundamentals of domination in graphs","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998a) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"key":"9389_CR5","volume-title":"Domination in graphs: advanced topics","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998b) Domination in graphs: advanced topics. Marcel Dekker, New York"},{"key":"9389_CR6","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1016\/j.dam.2010.01.009","volume":"158","author":"MA Henning","year":"2010","unstructured":"Henning MA, Kazemi AP (2010) k-Tuple total domination in graphs. Discrete Appl Math 158:1006\u20131011","journal-title":"Discrete Appl Math"},{"key":"9389_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.11650\/twjm\/1500558307","volume":"6","author":"CS Liao","year":"2002","unstructured":"Liao CS, Chang GJ (2002) Algorithmic aspects of k-tuple domination in graphs. Taiwan J Math 6:415\u2013420","journal-title":"Taiwan J Math"},{"key":"9389_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","volume":"87","author":"CS Liao","year":"2003","unstructured":"Liao CS, Chang GJ (2003) k-Tuple domination in graphs. Inf Process Lett 87:45\u201350","journal-title":"Inf Process Lett"},{"key":"9389_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.7151\/dmgt.1023","volume":"16","author":"RJ Nowakowski","year":"1996","unstructured":"Nowakowski RJ, Rall DF (1996) Associative graph products and their independence, domination and coloring numbers. Discuss Math, Graph Theory 16:53\u201379","journal-title":"Discuss Math, Graph Theory"},{"key":"9389_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.7151\/dmgt.1257","volume":"25","author":"DF Rall","year":"2005","unstructured":"Rall DF (2005) Total domination in categorical products of graphs. Discuss Math, Graph Theory 25:35\u201344","journal-title":"Discuss Math, Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9389-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9389-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9389-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:02:49Z","timestamp":1559980969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9389-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,2]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9389"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9389-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,2]]}}}