{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T13:29:51Z","timestamp":1776691791363,"version":"3.51.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf01371728","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T23:51:18Z","timestamp":1112399478000},"page":"271-291","source":"Crossref","is-referenced-by-count":17,"title":["On the diameter and bisector size of Cayley graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Fred","family":"Annexstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Baumslag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di (1983): Sorting inc logn parallel steps.Combinatorica 3, 1?19.","journal-title":"Combinatorica"},{"key":"CR2","unstructured":"S. B. Akers and B. Krishnamurthy (1987): The fault tolerance of star graphs.Proc. 2nd Internat. Conf. on Supercomputing, pp. 270?276."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"S. B. Akers and B. Krishnamurthy (1989): A group-theoretic model for symmetric interconnection networks.IEEE Trans. Comput. 38, 555?566.","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"CR4","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/0219037","volume":"19","author":"F. Annexstein","year":"1990","unstructured":"F. Annexstein, M. Baumslag, and A. L. Rosenberg (1990): Group-action graphs and parallel architectures.SIAM J. Comput. 19(3), 544?569.","journal-title":"SIAM J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"L. Babai (1991): Local expansion of vertex transitive graphs and random generation in finite groups.Proc. 23rd ACM Symp. on Theory of Computing, pp. 164?174.","DOI":"10.1145\/103418.103440"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"L. Babai, G. Hetyei, W. M. Kantor, A. Lubotsky and A. Seress (1990): On the diameter of finite groups.Proc. 31st IEEE Symp. on Foundations of Computer Science, pp. 857?865.","DOI":"10.1109\/FSCS.1990.89608"},{"issue":"6","key":"CR7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0195-6698(89)80067-8","volume":"10","author":"L. Babai","year":"1989","unstructured":"L. Babai, W. M. Kantor, and A. Lubotsky (1989): Small diameter cayley graphs for finite simple groups.European J. Combin. 10(6), 507?522.","journal-title":"European J. Combin."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1112\/plms\/s3-25.4.603","volume":"25","author":"H. Bass","year":"1972","unstructured":"H. Bass (1972): The degree of polynomial growth for finitely generated nilpotent groups.Proc. London Math. Soc. 25, 603?614.","journal-title":"Proc. London Math. Soc."},{"key":"CR9","unstructured":"M. Baumslag and A. L. Rosenberg (1991): Processor-time tradeoffs for cayley graph interconnection networks.Proc. 6th Distributed Memory Computing Conf., pp. 630?636."},{"key":"CR10","unstructured":"L. Campbell, G. E. Carlsson, V. Faber, M. R. Fellows, M. A. Langston, J. W. Moore, A. P. Mullhaupt, and H. B. Sexton (1988): Dense symmetric networks from linear groups and codes. Computer Science Technical Report CS-88-192, Washington State University."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TC.1985.1676627","volume":"34","author":"G. E. Carlsson","year":"1985","unstructured":"G. E. Carlsson, J. E. Cruthirds, H. B. Sexton, and C. G. Wright (1985): Interconnection networks based on a generalization of cube-connected cycles.IEEE Trans. Comput. 34, 769?772.","journal-title":"IEEE Trans. Comput."},{"key":"CR12","unstructured":"G. E. Carlsson, M. R. Fellows, H. B. Sexton, and C. G. Wright (1988): Group theory as an organizing principle in parallel processing.J. Combin. Theory Combin. Comput. 3."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"R. N. Draper (1991): An overview of supertoroidal networks.Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, pp. 95?102.","DOI":"10.1145\/113379.113388"},{"key":"CR14","unstructured":"V. Faber (1989): Global communication algorithms for hypercubes and other Cayley coset graphs.SIAM J. Discrete Math."},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/0401018","volume":"1","author":"P. Feldman","year":"1988","unstructured":"P. Feldman, J. Friedman, and N. Pippenger (1988): Wide-sense nonblocking networks.SIAM J. Discrete Math. 1(2), 158?173.","journal-title":"SIAM J. Discrete Math."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"22","author":"O. Gabber","year":"1981","unstructured":"O. Gabber and Z. Galil (1981): Explicit constructions of linear-sized superconcentrators.J. Comput. System Sci. 22, 407?420.","journal-title":"J. Comput. System Sci."},{"key":"CR17","volume-title":"Invariant Means on Topological Groups","author":"F. P. Greenleaf","year":"1969","unstructured":"F. P. Greenleaf (1969):Invariant Means on Topological Groups, Van Nostrand, New York."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02698687","volume":"53","author":"M. Gromov","year":"1981","unstructured":"M. Gromov (1981): Groups of polynomial growth and expanding maps.Publ. Math. IHES 53, 53?78.","journal-title":"Publ. Math. IHES"},{"key":"CR19","volume-title":"Theory of Groups","author":"M. Hall Jr.","year":"1976","unstructured":"M. Hall, Jr. (1976):Theory of Groups. Chelsea, New York."},{"issue":"1","key":"CR20","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1137\/0213011","volume":"13","author":"M. Klawe","year":"1984","unstructured":"M. Klawe (1984): Limitations on explicit constructions of expanding graphs.SIAM J. Comput. 13(1), 156?166.","journal-title":"SIAM J. Comput."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"F. T. Leighton and B. Maggs (1989): Expanders might be practical: fast algorithms for routing around faults on multibutterflies.Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 384?389.","DOI":"10.1109\/SFCS.1989.63507"},{"key":"CR22","unstructured":"A. Lubotsky (1990): Discrete Groups, Expanding Graphs, and Invariant Measures. Unpublished manuscript."},{"issue":"3","key":"CR23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotsky","year":"1988","unstructured":"A. Lubotsky, R. Phillips, and P. Sarnak (1988): Ramanujan graphs.Combinatorica 8(3), 261?277.","journal-title":"Combinatorica"},{"issue":"4","key":"CR24","first-page":"71","volume":"9","author":"G. Margulis","year":"1975","unstructured":"G. Margulis (1975): Explicit constructions of concentrators.Problemy Peredachi Informatisii 9(4), 71?80(Problems Inform. Transmission,10, 325?332).","journal-title":"Problemy Peredachi Informatisii"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01371728.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01371728\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01371728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T09:47:05Z","timestamp":1556876825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01371728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF01371728"],"URL":"https:\/\/doi.org\/10.1007\/bf01371728","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}