This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Unit GT Basic Concepts in Graph Theory Section 1: What is a Graph? There are various types of graphs, each with its own definition. Unfortunately, some people apply the term “graph” rather loosely, so you can’t be sure what type of graph they’re talking about unless you ask them. After you have finished this chapter, we expect you to use the terminology carefully, not loosely. To motivate the various definitions, we’ll begin with some examples. Example 1 (A computer network) Computers are often linked with one another so that they can interchange information. Given a collection of computers, we would like to describe this linkage in fairly clean terms so that we can answer questions such as “How can we send a message from computer A to computer B using the fewest possible intermediate computers?” We could do this by making a list that consists of pairs of computers that are connected. Note that these pairs are unordered since, if computer C can communicate with computer D, then the reverse is also true. (There are sometimes exceptions to this, but they are rare and we will assume that our collection of computers does not have such an exception.) Also, note that we have implicitly assumed that the computers are distinguished from each other: It is insufficient to say that “A PC is connected to a Mac.” We must specify which PC and which Mac. Thus, each computer has a unique identifying label of some sort. For people who like pictures rather than lists, we can put dots on a piece of paper, one for each computer. We label each dot with a computer’s identifying label and draw a curve connecting two dots if and only if the corresponding computers are connected. Note that the shape of the curve does not matter (it could be a straight line or something more complicated) because we are only interested in whether two computers are connected or not. Below are two such pictures of the same graph. Each computer has been labeled by the initials of its owner. EN SH RL CS SM MN TM SE EN SH RL CS SM MN TM SE Computers (vertices) are indicated by dots ( • ) with labels. The connections (edges) are indicated by lines. When lines cross, they should be thought of as cables that lie on top of each other — not as cables that are joined. c circlecopyrt Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Basic Concepts in Graph Theory The notation P k ( V ) stands for the set of all kelement subsets of the set V . Based on the previous example we have Definition 1 (Simple graph) A simple graph G is a pair G = ( V,E ) where • V is a finite set, called the vertices of G , and • E is a subset of P 2 ( V ) (i.e., a set E of twoelement subsets of V ), called the edges of G ....
View
Full
Document
This note was uploaded on 02/11/2008 for the course CSE 21 taught by Professor Graham during the Fall '07 term at UCSD.
 Fall '07
 Graham

Click to edit the document details