{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T22:49:29Z","timestamp":1776466169985,"version":"3.51.2"},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"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":[[2004,3]]},"DOI":"10.1016\/s0166-218x(03)00260-9","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:36Z","timestamp":1063378176000},"page":"173-195","source":"Crossref","is-referenced-by-count":37,"title":["A survey on Kn\u00f6del graphs"],"prefix":"10.1016","volume":"137","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\u20133","key":"10.1016\/S0166-218X(03)00260-9_BIB1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0012-365X(00)00289-2","article-title":"All-to-all wavelength routing in all-optical compound networks","volume":"235","author":"Amar","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB2","unstructured":"B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in all-optical networks, in: Proceedings of the 2nd IPPS Workshop on Optics and Computer Science, Geneva, 1997."},{"issue":"2","key":"10.1016\/S0166-218X(03)00260-9_BIB3","first-page":"109","article-title":"A note on the dimensionality of modified Kn\u00f6del graphs","volume":"8","author":"Bermond","year":"1997","journal-title":"IJFCS: Int. J. Foundations Comput. Sci."},{"issue":"2","key":"10.1016\/S0166-218X(03)00260-9_BIB4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TIT.1987.1057290","article-title":"The forwarding index of communication networks","volume":"39","author":"Chung","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB5","doi-asserted-by":"crossref","unstructured":"J. Cohen, P. Fraigniaud, C. Gavoille, Recognizing bipartite incident-graphs of circulant digraphs, in: 25th International Workshop on Graph\u2013Theoretic Concepts in Computer Science (WG\u201999), Vol. 1665 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pp.215\u2013227.","DOI":"10.1007\/3-540-46784-X_22"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB6","unstructured":"J. de Rumeur, Communications dans les r\u00e9seaux d'interconnexion, Masson, 1994."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB7","doi-asserted-by":"crossref","unstructured":"M.J. Dinneen, M.R. Fellows, V. Faber, Algebraic constructions of efficient broadcast networks, Proceedings of Applied Algebra, Algorithms and Error Correcting Codes (AAECC\u201991), Vol. 539, Lectures Notes in Computer Science, Springer, Berlin, 1991, pp. 152\u2013158.","DOI":"10.1007\/3-540-54522-0_104"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","article-title":"Minimal broadcast networks","volume":"9","author":"Farley","year":"1979","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","article-title":"Minimum broadcast graphs","volume":"25","author":"Farley","year":"1979","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/S0166-218X(03)00260-9_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(99)00282-0","article-title":"On the structure of minimum broadcast digraphs","volume":"245","author":"Fertin","year":"2000","journal-title":"Theoret. Comput. Sci."},{"issue":"215","key":"10.1016\/S0166-218X(03)00260-9_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0012-365X(99)00227-7","article-title":"A study of minimum gossip graphs","volume":"1\u20133","author":"Fertin","year":"2000","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/S0166-218X(03)00260-9_BIB12","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1002\/1097-0037(200009)36:2<126::AID-NET8>3.0.CO;2-3","article-title":"Compounding of gossip graphs","volume":"36","author":"Fertin","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB13","unstructured":"G. Fertin, J.G. Peters, Optimal odd gossiping, Technical Report CMPT TR 1998-24, Simon Fraser University, Burnaby, B.C., December 1998. Available at ftp:\/\/fas.sfu.ca\/pub\/cs\/TR\/1998\/CMPT1998-24.ps.gz. submitted for publication."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB14","doi-asserted-by":"crossref","unstructured":"G. Fertin, A. Raspaud, Families of graphs having broadcasting and gossiping properties, in: Proceedings of the 24th International Workshop on Graph\u2013Theoretic Concepts in Computer Science (WG\u201998), Vol. 1517. Smolenice, LNCS, 1998, pp. 63\u201377.","DOI":"10.1007\/10692760_6"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB15","doi-asserted-by":"crossref","unstructured":"G. Fertin, A. Raspaud, O. S\u00fdkora, H. Schr\u00f6der, I. Vrto, Diameter of Kn\u00f6del graph, in: 26th International Workshop on Graph\u2013Theoretic Concepts in Computer Science (WG 2000), volume 1928 of Lecture Notes in Computer Science, Springe, Berlin, 2000, pp. 149\u2013160.","DOI":"10.1007\/3-540-40064-8_15"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB17","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1002\/net.1033","article-title":"Minimum linear gossip graphs and maximal linear (\u0394, k)-gossip graphs","volume":"38","author":"Fraigniaud","year":"2001","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB18","unstructured":"G. Gauyacq, Routages Uniformes dans les Graphes Sommet-transitifs, Ph.D. Thesis, Universit\u00e9 Bordeaux 1, 1995."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB20","unstructured":"M-C. Heydemann, N. Marlin, S. Perennes, Cayley graphs with complete rotations, Technical report, Laboratoire de Recherche en Informatique (Orsay), 1997. TR-1155, submitted for publication."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB21","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (broadcasting and gossiping)","author":"Hromkovi\u010d","year":"1995"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB22","unstructured":"L.H. Khachatrian, H.S. Haroutunian, Construction of new classes of minimal broadcast networks, Proceedings of the Third International Colloquium on Coding Theory, 1990, pp. 69\u201377."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","article-title":"New gossips and telephones","volume":"13","author":"Kn\u00f6del","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB24","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.3230230416","article-title":"Some minimum gossip graphs","volume":"23","author":"Labahn","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00260-9_BIB25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0166-218X(92)90148-4","article-title":"Minimum broadcast digraphs","volume":"37\/38","author":"Liestman","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","article-title":"On forwarding indices of networks","volume":"23","author":"Meyer","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB27","doi-asserted-by":"crossref","unstructured":"J.-H. Park, K.-Y. Chwa, Recursive circulant: a new topology for multicomputers networks (extended abstract), in: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks ISPAN\u201994, Kanazawa, Japan, 1994, pp. 73\u201380.","DOI":"10.1109\/ISPAN.1994.367162"},{"issue":"244","key":"10.1016\/S0166-218X(03)00260-9_BIB28","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0304-3975(00)00176-6","article-title":"Recursive circulants and their embeddings among hypercubes","volume":"1\u20132","author":"Park","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB29","unstructured":"O. Togni, Force des Graphes\u2014Indice Optique des R\u00e9seaux, Ph.D. Thesis, Universit\u00e9 Bordeaux 1, 1998."},{"key":"10.1016\/S0166-218X(03)00260-9_BIB30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","article-title":"Connectivity of 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:S0166218X03002609?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002609?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:21:41Z","timestamp":1551014501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03002609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0166218X03002609"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00260-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}