Skip to main content
SpringerLink
Log in
Book cover

Graphen Algorithmen Netze pp 10–48Cite as

Grundbegriffe

  • Chapter

  • 112 Accesses

Part of the book series: Moderne Kommunikationstechnik ((XMK))

Zusammenfassung

Ein Pseudograph ist ein Tripel P = (E, K, v) bestehend aus einer Eckenmenge E, einer Kantenmenge K und einer (Inzidenz-) Abbildung

$$ v:K \to \left\{ {\{ x,y\} \left| {x,y \in E} \right.} \right\} $$

This is a preview of subscription content, 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   49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Busacker, R.G.; Saaty, T.L. Endliche Graphen und Netzwerke Oldenbourg, 1968

    Google Scholar 

  2. Chan, S. P. Introductory topological analysis of el. networks Holt, Rinehart and Winston, 1969

    Google Scholar 

  3. Chen, W.K. Applied graph theory North Holland, 1971

    Google Scholar 

  4. Deo, N. Graph theory with applications to engineering and computer science Prentice Hall, 1974

    Google Scholar 

  5. Ford, L.R.; Fulkerson, D.R. Flows in networks Princeton University Press, 1962

    Google Scholar 

  6. Garey, M.R.; Johnson, D.S. Computers and Intractability W.H. Freeman, 1979

    Google Scholar 

  7. Gould, R. Graph theory Benjamin/Cummings, 1988

    Google Scholar 

  8. Harary, F. Graph theory Adison-Wesley, 1969

    Google Scholar 

  9. Jungnickel, D. Graphen, Netzwerke und Algorithmen B.I, 1987

    Google Scholar 

  10. König, D. Theorie der endlichen und unendlichen Graphen Chelsea, 1950

    Google Scholar 

  11. Mayeda, W. Graph theory Wiley, 1972

    Google Scholar 

  12. Ore, O. Theory of graphs Am. Math. Soc., Coll. Pub., 1962

    MATH  Google Scholar 

  13. Ore, O. Graphs and their uses Random House, 1963

    Google Scholar 

  14. Papadimitriou, C.H.; Steiglitz, K. Combinatorial Optimization Prentice-Hall, 1982

    Google Scholar 

  15. Read, E. Graph theory and computing Academic Press, 1972

    MATH  Google Scholar 

  16. Seshu, S.; Reed, M. Linear graphs and electrical networks Addison Wesley, 1961

    Google Scholar 

  17. Swamy, M.N.S.; Thularisaman, K. Graphs, networks and algorithms Wiley Interscience, 1981

    Google Scholar 

  18. Wilson, R.J. Introduction to graph theory Academic Press, 1972

    Google Scholar 

Download references

Authors
  1. Firoz Kaderali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Poguntke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden

About this chapter

Cite this chapter

Kaderali, F., Poguntke, W. (1995). Grundbegriffe. In: Graphen Algorithmen Netze. Moderne Kommunikationstechnik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-89870-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-89870-8_1

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-528-06662-8

  • Online ISBN: 978-3-322-89870-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation