IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4419-5513-5_2.html
   My bibliography  Save this book chapter

Network Theory

In: Networks in Action

Author

Listed:
  • Gerard Sierksma

    (Fac. Economische Wetenschappen Rijksuniversiteit Groningen)

  • Diptesh Ghosh

    (Indian Institute of Management)

Abstract

Network optimization needs to use many terms and notions used in graph theory. In this chapter we seek to introduce most of the graph theory terms and notions used in the book. We also introduce some concepts used in the study of algorithms. To explain these concepts, we will make use of a fictitious map of one of the facilities of the fictitious Global Telecom Company (GTC). The map is shown in Figure B.1 and is drawn to scale. If we want to depict the connectivity among various points in the facility, we can have a schematic representation of the map as shown in Figure B.2. In this figure, the locations of the map have been replaced by points, depicted as labeled circles. In Figure B.2 for example, point 1 represents the Security building in the map, point 2 represents the Reception desk, point 3 represents Warehouse 1, and so on. The lines between the points show that the buildings represented by the points are connected by a direct road segment. Figure B.2 is known as a graph. The points 1, 2,... , 10 are referred to as nodes (or vertices) of the graph, and the lines between the nodes are referred to as edges (or links) in the graph. Hence a graph is just a collection of nodes and edges linking pairs of nodes. In some graphs, we allow more than one edges to connect a pair of nodes. As a special case of such graphs, an edge may connect a node to itself. Graphs with such possibilities are called multigraphs. Graphs that are not multigraphs are called simple graphs.

Suggested Citation

  • Gerard Sierksma & Diptesh Ghosh, 2010. "Network Theory," International Series in Operations Research & Management Science, in: Networks in Action, chapter 0, pages 3-10, Springer.
  • Handle: RePEc:spr:isochp:978-1-4419-5513-5_2
    DOI: 10.1007/978-1-4419-5513-5_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-1-4419-5513-5_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.