Skip to main content

Introduction to Graph Theory

  • Chapter
Discrete Mathematics for Computing
  • 179 Accesses

Abstract

The objects that we study in the branch of mathematics known as graph theory are not graphs drawn with x and y axes. In this chapter, the word ‘graph’ refers to a structure consisting of points (called ‘vertices’), some of which may be joined to other vertices by lines (called ‘edges’) to form a network. Structures of this type abound in computing. The computers on a site may be connected into a local area network, which in turn may be linked to national and international communications networks. The circuitry inside a computer (which we represented schematically by digital circuit diagrams in Chapter 8) is another example of a graph or network structure. At a more abstract level, we saw in Chapter 5 how a relation on a set can be depicted using a diagram that takes the form of a graph.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1995 Peter Grossman

About this chapter

Cite this chapter

Grossman, P. (1995). Introduction to Graph Theory. In: Discrete Mathematics for Computing. Palgrave, London. https://doi.org/10.1007/978-1-349-13908-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-13908-8_10

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-64694-6

  • Online ISBN: 978-1-349-13908-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics