{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:46:45Z","timestamp":1649191605002},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":4672,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1016\/s0166-218x(00)00199-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:24:15Z","timestamp":1027614255000},"page":"137-145","source":"Crossref","is-referenced-by-count":2,"title":["On (d,2)-dominating numbers of binary undirected de Bruijn graphs"],"prefix":"10.1016","volume":"105","author":[{"given":"Changhong","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juming","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kemin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00199-2_BIB1","unstructured":"J. Bermond, C. Peyrat, de Bruijn, Kautz networks: a competitor for the hypercube? Proceedings of the first European Workshop on Hypercube and Distributed Computer. North-Holland, Amsterdam, 1989, pp. 279\u2013294."},{"key":"10.1016\/S0166-218X(00)00199-2_BIB2","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1002\/net.3230240305","article-title":"Mengerian properties, Hamiltonicity and claw-free graphs","volume":"24","author":"Flandrin","year":"1994","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00199-2_BIB3","first-page":"668","article-title":"On container width and length in graphs, groups, and networks","volume":"77A","author":"Hsu","year":"1994","journal-title":"IEICE Trans. Fundam. E"},{"key":"10.1016\/S0166-218X(00)00199-2_BIB4","unstructured":"D.F. Hsu, Y.D. Lyuu, A graph-theoretical study of transmission delay and fault-tolerance, Proceedings of the Fourth ISSM International Conference on Parallel and Distributed Computing and Systems, 1991, pp. 20\u201324."},{"key":"10.1016\/S0166-218X(00)00199-2_BIB5","first-page":"291","article-title":"Note on the k-diameter of k-regular k-connected graphs","volume":"132","author":"Hsu","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00199-2_BIB6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<257::AID-NET1>3.0.CO;2-F","article-title":"The wide-diameter of the n-dimensional torodal mesh","volume":"27","author":"Ishigami","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00199-2_BIB7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/(SICI)1097-0037(199608)28:1<7::AID-NET2>3.0.CO;2-J","article-title":"2-diameter of de Bruijn graphs","volume":"28","author":"Li","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00199-2_BIB8","unstructured":"H. Li, J.M. Xu, (d,m)-dominating number of m-connected graphs, Rapport de Recherche, LRI, URA 410 du CNRS Universite de Paris-Sud No. 1130, 1997."},{"key":"10.1016\/S0166-218X(00)00199-2_BIB9","unstructured":"C.H. Lu, K.M. Zhang, A note of (d,m)-dominating numbers of hypercube Qm for \u230am2\u230b+2\u2a7d d\u2a7d m, submitted for publication."},{"key":"10.1016\/S0166-218X(00)00199-2_BIB10","doi-asserted-by":"crossref","unstructured":"D.K. Pradhan, Fault tolerant VISI architectures based on de Bruijn graphs (Galileo in the mid nineties). Reliability of Computer and Communication Networks, DIMACS Series, in Discr. Math. Theor. Comput. Sci. Vol 5, 1991, pp. 183\u2013196.","DOI":"10.1090\/dimacs\/005\/12"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001992?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001992?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T09:02:23Z","timestamp":1578733343000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0166218X00001992"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00199-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}