Skip to main content
SpringerLink
Log in

Diameter of the Knödel Graph

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1928))

Included in the following conference series:

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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Rumeur, J., Communications dans les Réseaux de Processeurs. Masson, Paris, 1994.

    Google Scholar 

  2. Demetrovics, J., PethŐ, A., Rónyai, L., On +-1 representations of integers, submitted for publication.

    Google Scholar 

  3. Decker, T., Monien, B., Preis, R., Towards optimal load balancing topologies, in: Proc. EUROPAR’2000, Lecture Notes in Computer Science, Springer Verlag, Berlin, 2000.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Fraigniaud, P., Lazard, E., Methods and problems of communication in usual networks, Discrete Applied Mathematics 53 (1994), 79–133.

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

  8. Hedetniemi, S. M., Hedetniemi, S. T., Liestman, A. L., A survey of gossiping and broadcasting in communication networks. Networks 18(1988), 319–349.

    Google Scholar 

  9. 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.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. Knödel, W., New gossips and telephones, Discrete Mathematics 13 (1975), 95.

    Article  MathSciNet  Google Scholar 

  12. Labahn, R., Some minimum gossip graphs, Networks 23 (1993), 333–341.

    Article  MATH  MathSciNet  Google Scholar 

  13. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université Bordeaux I, 351 Cours de la Libération, 33405, Talence, France

    Guillaume Fertin & André Raspaud

  2. School of Applied Science, Nanyang Technological University, Nanyang Avenue, 639798, Singapore, Republic of Singapore

    Heiko Schröder

  3. Department of Computer Science, Loughborough University, Loughborough, LE11 3TU, Leicestershire, UK

    Ondrej Sýkora

  4. Department of Informatics, Institute of Mathematics, Slovak Academy of Sciences, P.O. Box 56, 840 00, Bratislava, Slovak Republic

    Imrich Vrťo

Authors
  1. Guillaume Fertin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André Raspaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heiko Schröder
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ondrej Sýkora
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Imrich Vrťo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Konstanz, Box D 188, 78457, Konstanz, Germany

    Ulrik Brandes  & Dorothea Wagner  & 

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation