5.1-5.2 Quiz Review.

Slides:

Advertisements

Similar presentations

1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.

Advertisements

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.

 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.

Friendly Partitions of Graphs Jenna Huston Advised by Dr. David Offner.

Decision Maths Graphs Wiltshire Graphs A graph is just a diagram made up of “dots” and “lines”. These are all graphs. The dots are called “nodes” or.

Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

Graph Colouring Lecture 20: Nov 25.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

Drawing of G. Planar Embedding of G Proposition Proof. 1. Consider a drawing of K 5 or K 3,3 in the plane. Let C be a spanning cycle. 2. If the.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 4, Monday, September 8.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.

The Travelling Salesman Algorithm A Salesman has to visit lots of different stores and return to the starting base On a graph this means visiting every.

Coloring 3/16/121. Flight Gates flights need gates, but times overlap. how many gates needed? 3/16/122.

9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.

More Graphs, Subgraphs and Trees Planarity and Coloring.

Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.

ساختمانهای گسسته دانشگاه صنعتی شاهرود – فروردین 1392.

CS 200 Algorithms and Data Structures

Sec. 5.1: Planarity & Coloring

Some NP-complete Problems in Graph Theory Prof. Sin-Min Lee.

ساختمانهای گسسته دانشگاه صنعتی شاهرود – فروردین 1392.

Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.

Chap. 11 Graph Theory and Applications 1. Directed Graph 2.

Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.

Chapter 9.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6th ed., by Kenneth H.

Vertex orderings Vertex ordering.

Graph Concepts and Algorithms Using LEDA By Caroline Moore and Carmen Frerichs (252a-at and 252a-ao) each graph in the presentation was created using gw_basic_graph_algorithms.

1) Find and label the degree of each vertex in the graph.

Tree Diagrams A tree is a connected graph in which every edge is a bridge. There can NEVER be a circuit in a tree diagram!

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Various Orders and Drawings of Plane Graphs Takao Nishizeki Tohoku University.

Hamilton Paths and Circuits 1 Click to Start 2 3 Start End.

Today we will… Identify the vertices and edges on a given shape.

Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.

CSC 252 Pallavi Moorthy Homework 5. 1.) Vertices, edges From cd../../handout/demo/graph_alg/gw_shortest_path.

Weighted Graphs and traveling Salesperson problem

Characteristics of Planar Graphs

Redraw these graphs so that none of the line intersect except at the vertices B C D E F G H.

Applied Combinatorics, 4th Ed. Alan Tucker

Lecture 12 Graph Algorithms

Redraw this PCB in such a way that no wires cross.

UNIT 1: EULER CIRCUITS GRAPH THEORY.

Spanning Trees Discrete Mathematics.

Planarity Testing.

Connected Components Minimum Spanning Tree

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

A path that uses every vertex of the graph exactly once.

Applied Combinatorics, 4th Ed. Alan Tucker

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Decision Maths Graphs.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 8th ed., by Kenneth H.

Bipartite graphs and Planar Graphs

Warm Up – Tuesday Find the critical times for each vertex.

GRAPH THEORY Properties of Planar Graphs Ch9-1.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.

Prof. Ramin Zabih Graph Traversal Prof. Ramin Zabih

GRAPH THEORY Properties of Planar Graphs Ch9-1.

Exam 3 review Chapter 9- Graphs.

Presentation transcript:

5.1-5.2 Quiz Review

What am I? Determine if the following graphs are planar or nonplanar. If planar, redraw the graph.

Planar or Non-Planar?

Planar or Non-Planar?

Planar or Non-Planar?

Planar or Non-Planar?

Planar or Non-Planar?

Planar or Non-Planar?

Bipartite or Non-Bipartite?

Bipartite or Non-Bipartite?

Bipartite or Non-Bipartite?

Bipartite or Non-Bipartite?

If you were to draw a tree diagram, how many possible routes would you have?

If you were to draw a tree diagram, how many possible routes would you have?

Draw a tree diagram if you are starting at A.

Draw a tree diagram.

Find the shortest path using your tree diagram.

Shortest Path

Find the shortest path using the nearest neighbor method.

Find the shortest path using the nearest neighbor method.

Define bipartite.

Define bipartite. When the vertices of a graph can be separated into 2 subgroups, where no vertex of one subgroup is connected to a vertex in that same subgroup Chromatic # of 2

Define Planar.

Define Planar.