Task Tables Draw a graph for the following

Task Tables Draw a graph for the following task table. Task Start A B C D E F G H I Finish Time 0 5 1 8 2. 5 1. 5 3. 5 2 1 0. 5 Prerequisites --None A A C C B, D E F, G, H

Prerequisite – what needs to be done before a certain task Vertices – represent the tasks Edges – represent the person actually doing the task Arrows – show you what direction the tasks are being done in Number on the edge – goes with how much time it takes to do the task All graphs must have a Start and a Finish

A Start B

Critical Path – the list of tasks that were needed to show the shortest amount of time needed to complete a project Minimum project time – the shortest amount of time needed to complete the entire project

Earliest-start-time – the earliest EACH TASK can be started in the project Latest-start-time – the latest EACH TASK can be finished to stay on time for completion (procrastination date) These numbers are place at each task on your graph in a set of parentheses EST LST

Section 4. 3 Vocabulary Connected – a graph where there is a path between each pair of vertices Adjacent – two vertices that are connected by an edge Complete – a graph where each pair of vertices is adjacent, denoted by Kn , where n is the number of vertices in the graph Degree – the number of edges that have a specific vertex as an endpoint Loop – an edge that begins and ends at the same vertex Multiple edge – more than one edge between two vertices

A C B D Points A and D would be an example of adjacent points E A B D The graph is connected but not complete C This graph is complete. (all complete graph must be connected)

Complete graphs K 2 graphs K 3 graphs We use K to denote a complete graph and the number tells us how many vertices.

Alternate Ways to Write Graphs Graph, Matrices, and List C A B D A B C D V = {A, B, C, D} E = {AC, BD, CD} A 0 0 1 0 B 0 0 1 1 C 1 1 0 1 D 0 1 1 0

Degree: A=1 B=2 C=3 D=2 A C B D C This is a multiple edge B What is the degree of each vertex? D This is called a loop

Each of the black boxes are doors. Is it possible to walk through every door exactly once? A D B E C F

Euler Circuits and Paths Making picture into a graph. The room are the vertices and the doors (or how you walk from room to room) are the edges. Since we can walk in either direction through a door the edges have no arrows on them.

Euler Circuits and Paths Euler Paths – to use each edge of the graph exactly once but to end a vertex different from the starting vertex. Euler Circuit – to use each edge of the graph exactly once and begin and end at the same vertex.

Euler Circuits, Paths or Neither. B E A C D A A B G D B F E C D C E

Finding Circuits and paths To find a path – there must be exactly 2 vertices with odd degrees. They will be your beginning and end. To find a circuit – there must be a graph with all even vertices.

Digraphs – graphs with directions, the arrows point in the only direction that you are able to travel on the edge (think oneway roads) Indegree – number of edge coming in to a vertex Outdegree – number of edges going out of a vertex

Do these graphs have circuits, paths, or neither? A A B B C E E C D G F D

Create a set of rules for finding a Euler circuit or path in a digraph. Path – Circuit -

Hamiltonian Circuits and Paths Is it possible to touch every vertex and return to the same vertex you started at? F E D A B C Is this possible on all graphs?

Hamiltonian Circuits and Paths Hamiltonian Paths – to use each vertex of the graph exactly once but to end a vertex different from the starting vertex. Hamiltonian Circuit – to use each vertex of the graph exactly once and begin and end at the same vertex. (You do not have to use all of the edges and you cannot repeat a vertex) Cycle – any graph that is a Euler circuit and a Hamiltonian circuit

Do the following graphs have Hamiltonian Circuits, paths, or nethier? E C A A D B E C

Tournaments Tournament is a digraph that indicates who the winners are between two teams by the direction of the arrow. The arrow points at the losing team. B A D C In the above tournament A beats B, B beats no one, C beats A and B, and D beats everyone.

Tournament Vocabulary Transmitter – a vertex with a positive outdegree and a zero indegree Receiver – a vertex with a positive indegree and a zero outdegree.

Making a seating chart You are planning a trip and certain students do not get along with each other and cannot be in the same car. You also want to take the fewest number of cars possible. Students Cannot sit with: Meghan Hannah, Brooke, Jenifer Ashley Hannah, Lisa, Brooke, Kelly Hannah Meghan, Ashley, Tiffany, Lisa Tiffany Hannah, Kelly Candace Brooke, Jenifer Lisa Ashley, Hannah Brooke Meghan, Ashley, Candace Jenifer Meghan, Candace Kelly Ashley, Tiffany

A M T K H J Ca B L

Graph Coloring This process does not mean that you must actually color a map. It is a way to organize and group item, such as the people and the number of cars needed for the trip in the previous example. The numbers of label (or colors) needed is referred to as the chromatic number.

Copy the following map and color it so no two adjacent areas are the same color. E A D C B F

Make a graph from the following map and number the vertices, so that no two adjacent vertices have the same number. E A D C B F