{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:12:07Z","timestamp":1720051927598},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"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":[[1992,7]]},"DOI":"10.1016\/0166-218x(92)90134-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"205-226","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Connectivity, persistence and fault diagnosis of interconnection networks based on Ok and 2Ok graphs"],"prefix":"10.1016","volume":"37-38","author":[{"given":"Arif","family":"Ghafoor","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90134-V_BIB1","first-page":"270","article-title":"The fault-tolerance in star graphs","author":"Akers","year":"1987","journal-title":"Proceedings 1987 International Conference Supercomputers"},{"key":"10.1016\/0166-218X(92)90134-V_BIB2","first-page":"581","article-title":"Fault diagnosis in a Boolean n-cube array of microprocessors","volume":"30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0166-218X(92)90134-V_BIB3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1112\/jlms\/s2-16.2.197","article-title":"Codes in bipartite distance-regular graphs","volume":"16","author":"Bannai","year":"1977","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0166-218X(92)90134-V_BIB4","series-title":"Algebraic Combinatorics I: Association Schemes","author":"Bannai","year":"1984"},{"key":"10.1016\/0166-218X(92)90134-V_BIB5","article-title":"Cyclic Difference Sets","volume":"182","author":"Baumert","year":"1971"},{"key":"10.1016\/0166-218X(92)90134-V_BIB6","series-title":"Introduction to the Theory of Graphs","author":"Behzad","year":"1971"},{"key":"10.1016\/0166-218X(92)90134-V_BIB7","series-title":"Survey in Combinatorics","first-page":"1","article-title":"Graphs and interconnection networks: diameter and vulnerability","volume":"82","author":"Bermond","year":"1983"},{"key":"10.1016\/0166-218X(92)90134-V_BIB8","first-page":"71","article-title":"Some odd graph theory","volume":"319","author":"Biggs","year":"1979"},{"key":"10.1016\/0166-218X(92)90134-V_BIB9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.3230110106","article-title":"Graphs as models of communication network vuluerability: connectivity and persistence","volume":"11","author":"Boesch","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90134-V_BIB10","series-title":"Strategic Computing: New Generation Computing Technology","author":"DARPA","year":"1983"},{"key":"10.1016\/0166-218X(92)90134-V_BIB11","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1109\/TCOM.1972.1091198","article-title":"The control of congestion in packet-switching networks","volume":"20","author":"Davies","year":"1984","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-218X(92)90134-V_BIB12","article-title":"Regular line symmetric graphs","author":"Folkman","year":"1966","journal-title":"Memorandum RM-4889-PR"},{"key":"10.1016\/0166-218X(92)90134-V_BIB13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/12.73594","article-title":"A study of odd graphs as interconnection networks","volume":"40","author":"Ghafoor","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90134-V_BIB14","first-page":"173","article-title":"Bipartite distance-regular interconnection topology for fault-tolerant multiprocessor systems","volume":"137","author":"Ghafoor","year":"1990","journal-title":"Proc. IEE-E"},{"key":"10.1016\/0166-218X(92)90134-V_BIB15","first-page":"I176","article-title":"Distance transitive graphs for fault-tolerant multiprocessor systems","author":"Ghafoor","year":"1989","journal-title":"Proceedings 18th International Conference on Parallel Processing"},{"key":"10.1016\/0166-218X(92)90134-V_BIB16","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(92)90134-V_BIB17","first-page":"23","author":"Kuhl","year":"1980","journal-title":"Distributed fault-tolerance for large multiprocessor system"},{"key":"10.1016\/0166-218X(92)90134-V_BIB18_1","volume":"Vol. I","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0166-218X(92)90134-V_BIB18_2","volume":"Vol. II","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0166-218X(92)90134-V_BIB19","first-page":"173","article-title":"A comparison connection assignment for self-diagnosis of multiprocessor systems","author":"Maeng","year":"1981","journal-title":"Proceedings FTFC-11"},{"key":"10.1016\/0166-218X(92)90134-V_BIB20","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/12.2194","article-title":"Flip-trees: fault-tolerant graphs with wide containers","volume":"37","author":"Meyer","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90134-V_BIB21","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","article-title":"On the connection assignment problem of diagnosable system","volume":"16","author":"Preparata","year":"1967","journal-title":"IEEE Trans. Electron Comput."},{"key":"10.1016\/0166-218X(92)90134-V_BIB22","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(92)90134-V_BIB23","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0166-218X(92)90154-3","article-title":"Hadamard code covering in odd graphs","volume":"37\/38","author":"Sol\u00e9","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90134-V_BIB24","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","article-title":"NP-completeness of some generalization of the maximum matching problem","volume":"15","author":"Stockmeyer","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90134-V_BIB25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","article-title":"Connectivity in transitive graphs","volume":"8","author":"Watkins","year":"1970","journal-title":"J. Combin. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290134V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290134V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:38Z","timestamp":1555136618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290134V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":26,"alternative-id":["0166218X9290134V"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90134-v","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}