Abstract
Diameter of the 2k-node Knödel graph is [(k + 2)/2].
On leave from Institute of Mathematics, Slovak Academy of Sciences, Bratislava.
This research was supported by the EC grant ALTEC-KIT, The British Council grant to the project LORA-TAIN and the VEGA grant No. 02/7007/20.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
de Rumeur, J., Communications dans les Réseaux de Processeurs. Masson, Paris, 1994.
Demetrovics, J., PethŐ, A., Rónyai, L., On +-1 representations of integers, submitted for publication.
Decker, T., Monien, B., Preis, R., Towards optimal load balancing topologies, in: Proc. EUROPAR’2000, Lecture Notes in Computer Science, Springer Verlag, Berlin, 2000.
Dinneen, M. J., Fellows, M. R., Faber, V., Algebraic constructions of efficient broadcast networks, in: Proc. of Applied Algebra, Algorithms and Error Correcting Codes, Lecture Notes in Computer Science 539, Springer Verlag, Berlin, 1991, 152–158.
Fertin, G., Raspaud, A., Families of graphs having broadcasting and gossiping properties, in: Proc. of the 24th Intl. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1517, Springer Verlag, Berlin, 1998, 63–77.
Fraigniaud, P., Lazard, E., Methods and problems of communication in usual networks, Discrete Applied Mathematics 53 (1994), 79–133.
Fraigniaud, P., Peters, J.G., Minimum Linear Gossip Graphs and Maximal Linear (δ, k)-Gossip Graphs. Technical Report 94-06, School of Computing Science, Simon Fraser Univ., 1994. (ftp://fas.sfu.ca/pub/cs/techreports/1994/CMPT94-06.ps.gz)
Hedetniemi, S. M., Hedetniemi, S. T., Liestman, A. L., A survey of gossiping and broadcasting in communication networks. Networks 18(1988), 319–349.
Hromkoviĉ, J., Klasing, R., Monien, R., Peine, R., Dissemination of information in interconnection networks (Broadcasting and Gossiping), in: Combinatorial Network Theory Eds.: Frank Hsu, Ding-Zhu Du, 1995, Kluwer, Academic Publishers, 125–212.
Khachatrian, L. H., Haroutunian, H. S., Construction of new classes of minimal broadcast networks, in: Proc. of the 3rd Intl. Colloquium on Coding Theory, 1990, 69–77.
Knödel, W., New gossips and telephones, Discrete Mathematics 13 (1975), 95.
Labahn, R., Some minimum gossip graphs, Networks 23 (1993), 333–341.
Park, J.-H., Chwa, K.-Y., Recursive circulant: a new topology for multicomputers networks (extended abstract), in: Proc. of the Intl. Symposium on Parallel Architectures, Algorithms and Networks, 1994, 73–80.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fertin, G., Raspaud, A., Schröder, H., Sýkora, O., Vrťo, I. (2000). Diameter of the Knödel Graph. In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-40064-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41183-3
Online ISBN: 978-3-540-40064-6
eBook Packages: Springer Book Archive