4 Definition Let G = { V, E} and G = { V, E } be graphs. G and G are said to be isomorphic if there exist a pair of functions f : V V and g : E E such that f associates each element in V with exactly one element in V and vice versa; g associates each element in E with exactly one element in E and vice versa, and for each v V, and each e E, if v is an endpoint of the edge e, then f (v) is an endpoint of the edge g (e). Notes: To prove two graphs are isomorphic you must give a formula (picture) for the functions f and g. If two graphs are isomorphic, they must have: - the same number of vertices - the same number of edges - the same degrees for corresponding vertices - the same number of connected components - the same number of loops WUCT121 Graphs 28

5 - the same number of parallel edges. Further, - both graphs are connected or both graphs are not connected, and - pairs of connected vertices must have the corresponding pair of vertices connected. In general, it is easier to prove two graphs are not isomorphic by proving that one of the above properties fails. WUCT121 Graphs 29

6 Exercises: Show that the following graphs are isomorphic. WUCT121 Graphs 30

7 Draw all possible graphs having 2 edges and 2 vertices; that is, draw all non-isomorphic graphs having 2 edges and 2 vertices. Since isomorphic graphs are essentially the same, we can use this idea to classify graphs. WUCT121 Graphs 31

9 Draw all 2-regular graphs with 2 vertices; 3 vertices; 4 vertices Definition: Complete. A simple graph G = { V, E} is said to be complete if each vertex of G is connected to every other vertex of G. The complete graph with n vertices is denoted K n. Notes: A complete graph is connected isomorphic n, two complete graphs having n vertices are For complete graphs, once the number of vertices is known, the number of edges and the endpoints of each edge are also known WUCT121 Graphs 33

12 Definition: Bipartite. A simple graph G = { V, E} is said to be bipartite if there exists sets Notes: U V and W V, such that; 1. U W = V and U W = 2. every edge of G connects a vertex in U with a vertex in W. A bipartite graph G = { V, E} is one whose vertices can be separated into two disjoint sets, where every edge joins a vertex in one set to a vertex in the other u U, δ ( u) n( W ) and w W, δ ( w) n( U ) [ n (W ) is the number of elements in W] WUCT121 Graphs 36

15 Definition: Complete Bipartite. A simple graph G = { V, E}, is said to be complete bipartite if; Notes: 1. G is bipartite and 2. every vertex in U is connected to every vertex in W. A complete bipartite graph is one whose vertices can be separated into two disjoint sets where every vertex in one set is connected to every vertex in the other but no vertices within either set are connected. The symbol K n, m is used to denote the complete bipartite graph having n vertices in one set and m in the other. [Note that the comma is necessary!] u U, δ ( u) = n( W ) and w W, δ ( w) = n( U ) n ( E) = n m WUCT121 Graphs 39

18 1.9. Eulerian Graphs. Problem 1: If you are walking in the park, can you cross each bridge exactly once? Does it depend on where you start? Could you do it with less bridges? Could you do it with more bridges? Problem 2: The Koenigsberg Bridge Problem. WUCT121 Graphs 42

19 Can you stroll around, crossing each bridge exactly once and return to your starting point? No one can do it. How do you prove it can't be done? If you're Leonhard Euler, you make some definitions, make the problem precise and prove a theorem! Redraw the problem as a graph: Definition: Circuit. Let G = { V, E} be a graph and let v V. A circuit in G is a path from v to v in which no edge is repeated. Note: A circuit is a closed path and in many books is called a cycle. WUCT121 Graphs 43

20 Exercises: Write down the circuits in the following graph, starting at the given vertices. o v 2 : o v 1 : o v 3 : o v 7 : Definition: Eulerian Path Let G = { V, E} be a graph. A path in G is an Eulerian path if every edge of G is included once and only once in the path. WUCT121 Graphs 44

22 Can you find an Eulerian path in the following graph that is not an Eulerian circuit? v 1 e 1 v 2 e 6 e 4 e 2 v 3 v 5 e 5 v 4 e 3 Is the graph Eulerian? In the Koenisberg Bridge Problem, we wanted to start and end at the same vertex. That is, we need to prove that the graph K is not Eulerian. How? Theorem: Euler's Theorem. Let G be a connected graph. G is an Eulerian graph if and only if the degree of each vertex is even. WUCT121 Graphs 46

23 For the Koenisberg Bridge Problem: δ ( C) = 3, so the graph is not Eulerian. Discussion: Is the connectedness condition in Euler's Theorem necessary? Consider the graph Each vertex has even degree but there is no Eulerian circuit. WUCT121 Graphs 47

24 In the Koenisberg Bridge setup, is it possible to cross each bridge exactly once without necessarily finishing where you start? That is, is there an Eulerian path in K? Theorem: Existence of Eulerian Path. A connected graph has an Eulerian path, which is not a circuit, if it has exactly two vertices of odd degree. Example: δ ( A) = 3; δ ( B) = 5; δ ( C) = 3; δ ( D) = 3 There are more than 2 vertices of odd degree, therefore, K does not have an Eulerian path. WUCT121 Graphs 48

Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and

Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2

CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh Graph Theory: Graph theory can be defined as the study of graphs; Graphs are mathematical structures used to model pair-wise relations between

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

ame: Day: etworks and Paths Try This: For each figure,, and, draw a path that traces every line and curve exactly once, without lifting your pencil.... Figures,, and above are examples of ETWORKS. network

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

: Student Outcomes Prove the inscribed angle theorem: The measure of a central angle is twice the measure of any inscribed angle that intercepts the same arc as the central angle. Recognize and use different

Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

Beyond Watson: Predictive Analytics and Big Data U.S. National Security Agency Research Directorate - R6 Technical Report February 3, 2014 300 years before Watson there was Euler! The first (Jeopardy!)

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

Chapter 3.1 Angles Define what an angle is. Define the parts of an angle. Recall our definition for a ray. A ray is a line segment with a definite starting point and extends into infinity in only one direction.

Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

Answer Key Building Polynomial Functions 1. What is the equation of the linear function shown to the right? 2. How did you find it? y = ( 2/3)x + 2 or an equivalent form. Answers will vary. For example,

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

Shuffling, Cycles, and Matrices Warm up problem. Eight people stand in a line. From left to right their positions are numbered,,,... 8. The eight people then change places according to THE RULE which directs

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

Building Polynomial Functions NAME 1. What is the equation of the linear function shown to the right? 2. How did you find it? 3. The slope y-intercept form of a linear function is y = mx + b. If you ve

Polytope Examples (PolyComp Fukuda) Matching Polytope 1 Matching Polytope Let G = (V,E) be a graph. A matching in G is a subset of edges M E such that every vertex meets at most one member of M. A matching

0.1 Friend Trends This puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children. In the 1950s, a Hungarian sociologist S. Szalai

Max Flow, Min Cut, and Matchings (Solution) 1. The figure below shows a flow network on which an s-t flow is shown. The capacity of each edge appears as a label next to the edge, and the numbers in boxes

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

Nets of a cube puzzle Here are all eleven different nets for a cube, together with four that cannot be folded to make a cube. Can you find the four impostors? Pyramids Here is a square-based pyramid. A

Overview of Mathematics Task Arcs: Mathematics Task Arcs A task arc is a set of related lessons which consists of eight tasks and their associated lesson guides. The lessons are focused on a small number

Break-even analysis On page 256 of It s the Business textbook, the authors refer to an alternative approach to drawing a break-even chart. In order to survive businesses must at least break even, which

Graph Attack! 1. In the distant future, cosmic liaisons have been established between various bodies in the solar system. Rockets travel along the following routes: Earth-Mercury, Moon-Venus, Earth-Moon,

On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

Graph theory and network analysis Devika Subramanian Comp 140 Fall 2008 1 The bridges of Konigsburg Source: Wikipedia The city of Königsberg in Prussia was set on both sides of the Pregel River, and included

What is a Network? Network/Graph Theory Network = graph Informally a graph is a set of nodes joined by a set of lines or arrows. 1 1 2 3 2 3 4 5 6 4 5 6 Graph-based representations Representing a problem

Geometry Chapter 1 Section Term 1.1 Point (pt) Definition A location. It is drawn as a dot, and named with a capital letter. It has no shape or size. undefined term 1.1 Line A line is made up of points

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

Final Review Geometry Fall Semester Multiple Response Identify one or more choices that best complete the statement or answer the question. 1. Which graph shows a triangle and its reflection image over

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

Planar Graphs Complement to Chapter 2, The Villas of the Bellevue In the chapter The Villas of the Bellevue, Manori gives Courtel the following definition. Definition A graph is planar if it can be drawn

angle a figure formed by two rays called sides having a common endpoint called the vertex area the number of square units needed to cover a surface array a set of objects or numbers arranged in rows and

CHAPTER 13 SECTION 13-1 Geometry and Algebra The Distance Formula COORDINATE PLANE consists of two perpendicular number lines, dividing the plane into four regions called quadrants X-AXIS - the horizontal

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

Elementary triangle geometry Dennis Westra March 26, 2010 bstract In this short note we discuss some fundamental properties of triangles up to the construction of the Euler line. ontents ngle bisectors