{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:43Z","timestamp":1725544903113},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_45","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T12:00:37Z","timestamp":1265716837000},"page":"400-408","source":"Crossref","is-referenced-by-count":0,"title":["On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs"],"prefix":"10.1007","author":[{"given":"Yosuke","family":"Kikuchi","sequence":"first","affiliation":[]},{"given":"Yukio","family":"Shibata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","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 number of a graph. Discrete. Math. 23 (1978) 73\u201376","journal-title":"Discrete. Math"},{"key":"45_CR2","first-page":"27","volume":"98","author":"A.E. Barkauskas","year":"1993","unstructured":"Barkauskas, A.E., Host, L.H.: Finding efficient dominating sets in oriented graphs. Congr. Numer. 98 (1993) 27\u201332","journal-title":"Congr. Numer"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0020-0190(82)90021-7","volume":"14","author":"R. Bar-Yehuda","year":"1982","unstructured":"Bar-Yehuda, R., Vishkin, U.: Complexity of finding k-path-free dominating sets in graphs. Info. Process. Letter 14 (1982) 228\u2013232","journal-title":"Info. Process. Letter"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(77)90018-8","volume":"17","author":"C. Berge","year":"1977","unstructured":"Berge, C., Rao, A.R.: A combinatorial problem in logic. Discrete. Math. 17 (1977) 23\u201326","journal-title":"Discrete. Math"},{"key":"45_CR5","volume-title":"Hypercube and Distributed Computers","author":"J.-C. Bermond","year":"1989","unstructured":"Bermond, J.-C. Peyrat, C.: De Bruijn and Kautz networks: a competitor for the hypercube ?. Hypercube and Distributed Computers (F. Andr\u00e9 and J.P. Verjus, Eds.). Elsevier North-Holland, Amsterdam, 1989"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(94)00072-7","volume":"51","author":"G. Chaty","year":"1994","unstructured":"Chaty, G., Szwarcfiter, J.L.: Enumerating the kernels of a directed graph with no odd circuits. Info. Proc. Letter 51 (1994) 149\u2013153","journal-title":"Info. Proc. Letter"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0012-365X(93)90496-G","volume":"115","author":"P. Duchet","year":"1993","unstructured":"Duchet, P., Meyniel, H.: Kernels in directed graphs: a poison game. Discrete. Math. 115 (1993) 273\u2013276","journal-title":"Discrete. Math"},{"key":"45_CR8","first-page":"97","volume":"108","author":"D. Fisher","year":"1995","unstructured":"Fisher, D., Lundgren, J.R., Merz, S.K., Reid, K.B.: Domination graphs of tournaments and digraphs. Congr. Numer. 108 (1995) 97\u2013107","journal-title":"Congr. Numer"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0166-218X(79)90012-X","volume":"1","author":"A.S. Fraenkel","year":"1979","unstructured":"Fraenkel, A.S., Yesha, Y.: Complexity of problems in games,graphs, and algebraic equations. Discrete. Appl. Math. 1 (1979) 15\u201330","journal-title":"Discrete. Appl. Math"},{"key":"45_CR10","first-page":"401","volume-title":"Domination in graphs","author":"J. Ghoshal","year":"1998","unstructured":"Ghoshal, J., Laskar, R., Pillone, D.: Topics on domination in directed graphs. Domination in graphs (T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Eds.). Marcel Dekker, New York, 1998, 401\u2013437"},{"key":"45_CR11","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W. Hedetniemi, S.T. Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TC.1981.1675809","volume":"C-30","author":"M. Imase","year":"1981","unstructured":"Imase, M., Itoh, M.: Design to minimize diameter on building-block network. IEEE Trans. Computer C-30 (1981) 439\u2013442","journal-title":"IEEE Trans. Computer"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TC.1983.1676323","volume":"C-32","author":"M. Imase","year":"1983","unstructured":"Imase, M., Itoh, M.: A design for directed graphs with minimum diameter. IEEE Trans. Computer C-32 (1983) 782\u2013784","journal-title":"IEEE Trans. Computer"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(88)90131-4","volume":"61","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament. Theor. Comp. Sci. 61 (1988) 307\u2013316","journal-title":"Theor. Comp. Sci"},{"key":"45_CR15","unstructured":"Reddy, S.M., Pradhan, D.K., Kuhl, J.: Directed graphs with minimal diameter and maximum node connectivity. School of Engineering Oakland Univ. Tech. Report, 1980"},{"key":"45_CR16","volume-title":"Theory of Games and Economic Behaviour","author":"J. Neumann von","year":"1944","unstructured":"von Neumann J., Morgenstern, O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton, 1944."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T21:57:28Z","timestamp":1551045448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_45","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}