Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1


 Donald Rodgers
 2 years ago
 Views:
Transcription
1 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 of graph isomorphism.. presents symmetry from the perspective of automorphisms.. introduces subgraphs. Outline. Graph Isomorphism. Automorphisms and Symmetry. Subgraphs, part
2 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A. Graph Isomorphism Figure.: Two different drawings of the same graph. They are (clearly) the same because each vertex v has the exact same set of neighbors in both graphs
3 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A s G w y u z v t H 7 8 x Figure.: Two more drawings of that same graph. These two graphs are the same because, instead of having the same set of vertices, this time we have a bijection V G V H s t u 4 v 5 w 6 x 7 y 8 z between the two vertex sets, such that Nbhds map bijectively to nbhds; e.g., N() N(f()) = N(s), i.e. N() = {,, 5} {t, u, w} = {f(), f(), f(5)} = N(s)
4 4 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Structural Equivalence for Simple Graphs Def.. Let G and H be two simple graphs. A vertex function f : V G V H preserves adjacency if for every pair of adjacent vertices u and v in graph G, the vertices f(u) and f(v) are adjacent in graph H. Similarly, f preserves nonadjacency if f(u) and f(v) are nonadj whenever u and v are nonadj. Def.. A vertex bijection f : V G V H betw. two simple graphs G and H is structurepreserving if it preserves adjacency and nonadjacency. That is, for every pair of vertices in G, u and v are adj in G f(u) and f(v) are adj in H This leads us to a formal mathematical definition of what we mean by the same graph.
5 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 5 Def.. Two simple graphs G and H are isomorphic, denoted G = H, if a structurepreserving bijection f : V G V H. Such a function f is called an isomorphism from G to H. Notation: When we regard a vertex function f : V G V H as a mapping from one graph to another, we may write f : G H. ISOMORPHISM CONCEPT Two graphs related by isomorphism differ only by the names of the vertices and edges. There is a complete structural equivalence between two such graphs.
6 6 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A REPRESENTATION by DRAWINGS When the drawings of two isomorphic graphs look different, relabeling reveals the equivalence. One may use functional notation to specify an isomorphism between the two simple graphs shown. 6 7 a=f(0) b=f() d=f() c=f() 4 5 f=f(5) e=f(4) 0 g=f(6) h=f(7) Figure.: Specifying an isom betw two simple graphs. Alternatively, one may relabel the vertices of the codomain graph with names of vertices in the domain, as in Fig Figure.4: Another way of depicting an isomorphism.
7 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 7 ISOMORPHISM (SIMPLE) = BIJECTIVE on VERTICES ADJACENCYPRESERVING (NONADJACENCY)PRESERVING Example.. The vertex function j j +4 depicted in Fig.5 is bijective and adjacencypreserving, but it is not an isomorphism, since it does not preserve nonadjacency. In particular, the nonadjacent pair {0, } maps to the adjacent pair {4, 6} Figure.5: Bijective and adjpreserving, but not an isom.
8 8 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Example.. The vertex function j j mod depicted in Figure.6 is structurepreserving, since it preserves adjacency and nonadjacency, but it is not an isomorphism since it is not bijective. Figure.6: Preserves adj and nonadj, but not bijective.
9 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 9 Isomorphism for General Graphs The mapping f : V G V H between the vertexsets of the two graphs shown in Figure.7 given by f(i) = i, i =,, preserves adjacency and nonadjacency, but the two graphs are clearly not structurally equivalent. Figure.7: These graphs are not structurally equivalent. Def.4. A vertex bijection f : V G V H between two graphs G and H, simple or general, is structurepreserving if () the # of edges (even if 0) between every pair of distinct vertices u and v in graph G equals the # of edges between their images f(u) and f(v) in graph H, and () the # of selfloops at each vertex x in G equals the # of selfloops at the vertex f(x) in H.
10 0 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A This general definition of structurepreserving reduces, for simple graphs, to our original definition. Moreover, it allows a unified definition of isomorphic graphs for all cases. Def.5. Two graphs G and H (simple or general) are isomorphic graphs if structurepreserving vertex bijection f : V G V H This relationship is denoted G = H.
11 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Isomorphism for Graphs with MultiEdges Def.6. For isomorphic graphs G and H, a pair of bijections f V : V G V H and f E : E G E H is consistent if for every edge e E G, the function f V maps the endpoints of e to the endpoints of the edge f E (e). Proposition.. G = H iff there is a consistent pair of bijections f V : V G V H and f E : E G E H Proof. Straightforward from the definitions. Remark.. If G and H are isom simple graphs, then every structurepreserving vertex bijection f : V G V H induces a unique consistent edge bijection, by the rule: uv f(u)f(v).
12 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Def.7. If G and H are graphs with multiedges, then an isomorphism from G to H is specified by giving a consistent pair of bijections f V : V G V H and f E : E G E H. Example.7. Both of the structurepreserving vertex bijections G H in Fig.8 have six consistent edgebijections. G x y z H a b c Figure.8: There are distinct isoms from G to H.
13 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Necessary Properties of Isom Graph Pairs Although the examples below involve simple graphs, the properties apply to general graphs as well. Theorem.. Let G and H be isomorphic graphs. Then they have the same number of vertices and edges. Proof. An isomorphism maps V G and E G bijectively. Theorem.. Let f : G H be a graph isomorphism and let v V G. Then deg(f(v)) = deg(v). Proof. Since f is structurepreserving, the # of proper edges and the # of selfloops incident on vertex v equal the corresp # s for vertex f(v). Thus, deg(f(v)) = deg(v). Corollary.4. Let G and H be isomorphic graphs. Then they have the same degree sequence. Corollary.5. Let f : G H be a graph isom and e E G. Then the endpoints of edge f(e) have the same degrees as the endpoints of e.
14 4 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Example.8. In Fig.9 below, we observe that Q and CL 4 both have 8 vertices and edges and are regular. The vertex labelings specify a vertex bijection. A careful examination reveals that this vertex bijection is structurepreserving. It follows that Q and CL 4 are isomorphic graphs. 0 f(00) f(000) f(0) f(00) f() f(0) f(0) f(00) Figure.9: Hypercube Q and circ ladder CL 4 are isom.
15 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 5 Def.8. The Möbius ladder ML n is a graph obtained from the circular ladder CL n by deleting from the circular ladder two of its parallel curved edges and replacing them with two edges that crossmatch their endpoints. Example.9. K, and the Möbius ladder ML both have 6 vertices and 9 edges, and both are regular. The vertex labelings for the two drawings specify an isomorphism K, ML Figure.0: K, and the Möbius ladder ML are isom.
16 6 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Isomorphism Type of a Graph Def.9. Each equivalence class under = is called an isomorphism type. (Counting isomorphism types of graphs generally involves the algebra of permutation groups see Chap 4). Figure.: The 4 isom types for a simple vertex graph.
17 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 7 Isomorphism of Digraphs Def.0. Two digraphs G and H are isomorphic if there is an isomorphism f between their underlying graphs that preserves the direction of each edge. Example.0. Notice that nonisomorphic digraphs can have underlying graphs that are isomorphic. Figure.: Four nonisomorphic digraphs. Def.. The graphisomorphism problem is to devise a practical general algorithm to decide graph isomorphism, or, alternatively, to prove that no such algorithm exists.
18 8 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A. Automorphisms & Symmetry Def.. An isomorphism from a graph G to itself is called an automorphism. Thus, an automorphism π of graph G is a structurepreserving permutation π V on V G along with a (consistent) permutation We may write π = (π V, π E ). π E on E G Remark.. The proportion of vertexpermutations of V G that are structurepreserving is a measure of the symmetry of G.
19 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 9 Permutations and Cycle Notation The most convenient representation of a permutation, for our present purposes, is as a product of disjoint cycles. Remark.. As explained in Appendix A4, every permutation can be written as a composition of disjoint cycles. Example.. The permutation ( ) π = which maps to 7, to 4, and so on, has the disjoint cycle form π = ( 7 9 ) ( ) ( 5 )
20 0 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Geometric Symmetry A geometric symmetry on a graph drawing can be used to represent an automorphism on the graph. Example.. K, has six automorphisms. Each of them is realizable by a rotation or reflection of Fig.. u a w c x b v Figure.: The graph K,. Vertex Edge Symmetry permutation permutation identity (u) (v) (w) (x) (a) (b) (c) 0 rotation (x) (u v w) (a b c) 40 rotation (x) (u w v) (a c b) refl. thru a (x) (u) (v w) (a) (b c) refl. thru b (x) (v) (u w) (b) (a c) refl. thru c (x) (w) (u v) (c) (a b) There are no other automorphisms of K,.
21 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Example.. It is easy to verify that these vertexperms are structurepreserving, so they are all graph automorphisms Automorphisms λ 0 = ( ) ( ) ( ) ( 4) ( 5) ( 6) ( 7) ( 8) λ = ( 8) ( 7) ( ) ( 4) ( 5) ( 6) λ = ( ) ( ) ( 5) ( 4 6) ( 7) ( 8) λ = ( 8) ( 7) ( 5) ( 4 6) Figure.: A graph with four automorphisms.
22 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Limitations of Geometric Symmetry Example.4. The leftmost drawing has 5fold rotational symmetry that corresponds to the automorphism (0 4) ( ), but this automorphism does not correspond to any geometric symmetry of either of the other two drawings (a) (b) (c) Figure.: Three drawings of the Petersen graph.
23 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Vertex and EdgeTransitive Graphs Def.. A graph G is vertextransitive if for every vertex pair u, v V G, there is an automorphism that maps u to v. Def.. A graph G is edgetransitive if for every edge pair d, e E G, there is an automorphism that maps d to e. Example.5. K, is edgetrans, but not vertextrans, since every autom must map the valent vertex to itself. Example.7. The hypercube graph Q n is vertextrans and edgetrans for every n. (See Exercises.) Example.8. Every circulant graph circ(n; S) is vertextransitive. In particular, the vertex function i i + k mod n is an automorphism. Although circ( :, 5) is edgetransitive, some circulant graphs are not. (See Exercises.) Figure.4: The circulant graph circ( :, 5).
24 4 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Vertex Orbits and Edge Orbits Def.4. The equivalence classes of the vertices of a graph G under the action of the automorphisms are called vertex orbits. The equivalence classes of the edges are called edge orbits. Example.0. vertex orbits: {,8}, {4,6}, {,7}, {,5} edge orbits: {,78}, {4,56}, {,5,7,57}, {5} Automorphisms λ 0 = ( ) ( ) ( ) ( 4) ( 5) ( 6) ( 7) ( 8) λ = ( 8) ( 7) ( ) ( 4) ( 5) ( 6) λ = ( ) ( ) ( 5) ( 4 6) ( 7) ( 8) λ = ( 8) ( 7) ( 5) ( 4 6) Figure.5: Graph of Example..
25 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 5 Theorem.. All vertices in the same orbit have the exact same degree. Proof. This follows immediately from Theorem.. Theorem.. All edges in the same orbit have the same pair of degrees at their endpoints. Proof. This follows immediately from Corollary.5. Example.. Each of the two partite sets of K m,n is a vertex orbit. The graph is vertextransitive if and only if m = n; otherwise it has two vertex orbits. However, K m,n is always edgetransitive (see Exercises).
26 6 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A How to Find the Orbits We illustrate how to find orbits by consideration of two examples. (It is not known whether there exists a polynomialtime algorithm for finding orbits. Testing all n! vertexperms for the adjacency preservation property is too tedious an approach.) In addition to using Theorems. and., we observe that if an automorphism maps vertex u to vertex v, then it maps the neighbors of u to the neighbors of v. Example.. In Fig.6, the vertex orbits are The edge orbits are {0}, {, 4}, and {, } {}, {0, 04}, and {,, 4, 4} 0 4 Figure.6: Find the vertex orbits and the edge orbits.
27 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 7 Example.. We could approach the 4regular graph of Figure.7 by recognizing the symmetry (0 5)( 4)()()(6) and seeking to find others. However, it is possible to expedite the determination of orbits Figure.7: Find the vertex orbits and the edge orbits. When we look at vertices 0,,, and 5, we discover that each of them has a set of neighbors that are independent, while vertices, 4, and 6 each have two pairs of adjacent vertices. This motivates us to redraw the graph as in Figure Figure.8: Find the vertex orbits and the edge orbits. In that form, we see immediately that there are two vertex orbits, namely {0,,, 5} and {, 4, 6}. One of the two edge orbits is {05, }, and the other contains all the other edges.
28 8 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A. Subgraphs Def.. A subgraph of a graph G is a graph H whose vertices and edges are all in G. If H is subgraph of G, we may also say that G is a supergraph of H. Def.. A proper subgraph H of G is a subgraph such that V H is a proper subset of V G or E H is a proper subset of E G. Example.. Fig. shows the line drawings and corresponding incidence tables for two proper subgraphs of a graph. G u d e a c x v b edge endpts a b c d e f u v v u x w v z x x w z w f z u d H c x v edge endpts c d v u x x u w a d e H c x v z b edge endpts a b c d e u v v u x v z x x w Figure.: A graph G and two (proper) subgraphs H and H. The usual meaning of the phrase H is a subgraph of G is that H is merely isomorphic to a subgraph of G.
29 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 9 Spanning Subgraphs Def.. A subgraph H is said to span a graph G if V H = V G. Def.4. A spanning tree is a spanning subgraph that is a tree. Figure.: A spanning tree. Def.5. An acyclic graph is called a forest. G Figure.4: A spanning forest H of graph G.
30 0 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Cliques and Independent Sets Def.6. A subset S of V G is called a clique if every pair of vertices in S is joined by at least one edge, and no proper superset of S has this property. Def.7. The clique number of a graph G is the number ω(g) of vertices in a largest clique in G. Example.. In Fig.5, the vertex subsets, {u, v, y}, {u, x, y}, and {y, z} induce complete subgraphs, and ω(g) =. u v x y z Figure.5: A graph with three cliques. Def.8. A subset S of V G is said to be an independent set if no pair of vertices in S is joined by an edge. Def.9. The independence number of a graph G is the number α(g) of vertices in a largest independent set in G. Remark.. Thus, the clique # ω(g) and the indep # α(g) are complementary concepts (in the sense described in.4).
31 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Induced Subgraphs Def.0. Subgraph induced on subset U of V G, denoted G(U). V G(U) = U and E G(U) = {e E G : endpts(e) U} v v a b u c h f g a b u c h f g d w d w induced on {u, v} Figure.6: A subgraph induced on a subset of vertices.
32 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A 7. Supplementary Exercises Exercise Draw all isomorphism types of general graphs with edges and no isolated vertices. Exercise 4 Fig 7.. List the vertex orbits and the edge orbits of the graph of Figure 7.: 5 Exercise 7 Some of the 4vertex, simple graphs have exactly two vertex orbits. Draw an illustration of each such isomorphism type.
GRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
More information4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests
4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in
More informationSolutions to Exercises 8
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.
More information10. Graph Matrices Incidence Matrix
10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a
More informationGraph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick
Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements
More information(a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from
4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called
More informationChapter 2. Basic Terminology and Preliminaries
Chapter 2 Basic Terminology and Preliminaries 6 Chapter 2. Basic Terminology and Preliminaries 7 2.1 Introduction This chapter is intended to provide all the fundamental terminology and notations which
More informationGraph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.
Mária Markošová Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency. Isomorphism of graphs. Paths, cycles, trials.
More informationCMSC 451: Graph Properties, DFS, BFS, etc.
CMSC 451: Graph Properties, DFS, BFS, etc. Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Based on Chapter 3 of Algorithm Design by Kleinberg & Tardos. Graphs
More informationHomework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS
Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C
More informationOn Integer Additive SetIndexers of Graphs
On Integer Additive SetIndexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A setindexer of a graph G is an injective setvalued function f : V (G) 2 X such that
More information3. Equivalence Relations. Discussion
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,
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More informationPlanar Graph and Trees
Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationClass One: Degree Sequences
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
More informationTheorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.
Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the
More informationSets and functions. {x R : x > 0}.
Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.
More informationA graph is called a tree, if it is connected and has no cycles. A star is a tree with one vertex adjacent to all other vertices.
1 Trees A graph is called a tree, if it is connected and has no cycles. A star is a tree with one vertex adjacent to all other vertices. Theorem 1 For every simple graph G with n 1 vertices, the following
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationGraph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania
Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 Email: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More informationCOLORED GRAPHS AND THEIR PROPERTIES
COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring
More informationCSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24
CSL851: Algorithmic Graph Theory Semester I 20132014 Lecture 1: July 24 Lecturer: Naveen Garg Scribes: Suyash Roongta Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have
More informationCounting Spanning Trees
Counting Spanning Trees Bang Ye Wu KunMao Chao Counting Spanning Trees This book provides a comprehensive introduction to the modern study of spanning trees. A spanning tree for a graph G is a subgraph
More informationAnalyzing the Smarts Pyramid Puzzle
Analyzing the Smarts Pyramid Puzzle Spring 2016 Analyzing the Smarts Pyramid Puzzle 1/ 22 Outline 1 Defining the problem and its solutions 2 Introduce and prove Burnside s Lemma 3 Proving the results Analyzing
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with
More information1 Definitions. Supplementary Material for: Digraphs. Concept graphs
Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.
More informationCharacterizations of Arboricity of Graphs
Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs
More informationLecture 7. The MatrixTree Theorem. 7.1 Kircho s MatrixTree Theorem
Lecture The MatrixTree Theorem This section of the notes introduces a very beautiful theorem that uses linear algebra to count trees in graphs. Reading: The next few lectures are not covered in Jungnickel
More informationLecture 4: The Chromatic Number
Introduction to Graph Theory Instructor: Padraic Bartlett Lecture 4: The Chromatic Number Week 1 Mathcamp 2011 In our discussion of bipartite graphs, we mentioned that one way to classify bipartite graphs
More information1 Basic Definitions and Concepts in Graph Theory
CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
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
More informationForests and Trees: A forest is a graph with no cycles, a tree is a connected forest.
2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).
More information1. Relevant standard graph theory
Color identical pairs in 4chromatic graphs Asbjørn Brændeland I argue that, given a 4chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4coloring
More information(Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?
Vertex Coloring 2.1 33 (Vertex) Colorings Definition: A coloring of a graph G is a labeling of the vertices of G with colors. [Technically, it is a function f : V (G) {1, 2,...,l}.] Definition: A proper
More informationDO NOT REDISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should
More informationSimple Graphs Degrees, Isomorphism, Paths
Mathematics for Computer Science MIT 6.042J/18.062J Simple Graphs Degrees, Isomorphism, Types of Graphs Simple Graph this week MultiGraph Directed Graph next week Albert R Meyer, March 10, 2010 lec 6W.1
More informationCS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison GomoryHu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
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
More informationTree Cover of Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 150, 74697473 HIKARI Ltd, www.mhikari.com http://dx.doi.org/10.12988/ams.2014.49728 Tree Cover of Graphs Rosalio G. Artes, Jr. and Rene D. Dignos Department
More informationTHE 0/1BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER
THE 0/1BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER JONATHAN P. MCCAMMOND AND GÜNTER ZIEGLER Abstract. In 1933 Karol Borsuk asked whether every compact subset of R d can be decomposed
More informationAbout the Tutorial. Audience. Prerequisites. Disclaimer & Copyright
About the Tutorial This tutorial offers a brief introduction to the fundamentals of graph theory. Written in a readerfriendly style, it covers the types of graphs, their properties, trees, graph traversability,
More informationTreerepresentation of set families and applications to combinatorial decompositions
Treerepresentation of set families and applications to combinatorial decompositions BinhMinh BuiXuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no
More informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONEPOINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationMath 4707: Introduction to Combinatorics and Graph Theory
Math 4707: Introduction to Combinatorics and Graph Theory Lecture Addendum, November 3rd and 8th, 200 Counting Closed Walks and Spanning Trees in Graphs via Linear Algebra and Matrices Adjacency Matrices
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationBasic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by
Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More information1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if
Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these
More informationNetwork/Graph Theory. What is a Network? What is network theory? Graphbased representations. Friendship Network. What makes a problem graphlike?
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 Graphbased representations Representing a problem
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of HaifaORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationThe origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson)
Chapter 11 Graph Theory The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson) (N. Let us start with a formal definition of what is a graph. Definition 72. A graph
More informationChapter 4. Trees. 4.1 Basics
Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.
More informationLecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002
Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002 Eric Vigoda Scribe: Varsha Dani & Tom Hayes 1.1 Introduction The aim of this
More informationGRAPH THEORY and APPLICATIONS. Trees
GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.
More information14. Trees and Their Properties
14. Trees and Their Properties This is the first of a few articles in which we shall study a special and important family of graphs, called trees, discuss their properties and introduce some of their applications.
More informationLattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College
Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1
More informationLong questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and 3B.
Unit1: Matrix Algebra Short questions answer 1. What is Matrix? 2. Define the following terms : a) Elements matrix b) Row matrix c) Column matrix d) Diagonal matrix e) Scalar matrix f) Unit matrix OR
More informationConnectivity and cuts
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
More informationA tree can be defined in a variety of ways as is shown in the following theorem: 2. There exists a unique path between every two vertices of G.
7 Basic Properties 24 TREES 7 Basic Properties Definition 7.1: A connected graph G is called a tree if the removal of any of its edges makes G disconnected. A tree can be defined in a variety of ways as
More informationThe edge slide graph of the ndimensional cube
The edge slide graph of the ndimensional cube Howida AL Fran Institute of Fundamental Sciences Massey University, Manawatu 8th Australia New Zealand Mathematics Convention December 2014 Howida AL Fran
More informationChapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
9 Properties of Trees. Definitions: Chapter 4: Trees forest  a graph that contains no cycles tree  a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
More informationMIXDECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia
GLASNIK MATEMATIČKI Vol. 38(58)(2003), 2 232 MIXDECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3 Damir Vukičević University of Split, Croatia
More informationModule MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions
Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationDiscrete Mathematics. Hans Cuypers. October 11, 2007
Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................
More informationComplete graphs whose topological symmetry groups are polyhedral
Algebraic & Geometric Topology 11 (2011) 1405 1433 1405 Complete graphs whose topological symmetry groups are polyhedral ERICA FLAPAN BLAKE MELLOR RAMIN NAIMI We determine for which m the complete graph
More informationAutomated Generation of Search Tree Algorithms
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems Jens Gramm Jiong Guo Falk Hüffner Rolf Niedermeier WilhelmSchickardInstitut für Informatik, Universität Tübingen, Sand
More informationGraph Homomorphisms and Universal Algebra Course Notes
Graph Homomorphisms and Universal Algebra Course Notes Manuel Bodirsky, Institut für Algebra, TU Dresden, Manuel.Bodirsky@tudresden.de October 7, 2016 Contents 1 The Basics 2 1.1 Graphs and Digraphs................................
More informationRelations Graphical View
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
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
More informationDefinition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:
1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph
More informationDivisor graphs have arbitrary order and size
Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More information1 Symmetries of regular polyhedra
1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationThe treenumber and determinant expansions (Biggs 67)
The treenumber and determinant expansions (Biggs 67) André Schumacher March 20, 2006 Overview Biggs 67 [1] The treenumber κ(γ) κ(γ) and the Laplacian matrix The σ function Elementary (sub)graphs Coefficients
More informationIntersection Dimension and Maximum Degree
Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai  600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show
More informationGroup Theory in Rubik's Cube. Pritish Kamath special thanks to Nishant Totla
Group Theory in Rubik's Cube Pritish Kamath special thanks to Nishant Totla Overview Notations Counting Rubik's cube configurations... Quick review of Group Theory. The Rubik's Cube Group. More Group Theory
More informationInstitut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie. An Iterative Compression Algorithm for Vertex Cover
FriedrichSchillerUniversität Jena Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover von Thomas Peiselt
More informationarxiv: v1 [math.gr] 18 Apr 2016
Unfoldings of the Cube Richard Goldstone Manhattan College Riverdale, NY 1071 richard.goldstone@manhattan.edu arxiv:160.0500v1 [math.gr] 18 Apr 2016 Robert Suzzi Valli Manhattan College Riverdale, NY 1071
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A klabeling of vertices of a graph G(V, E) is a function V [k].
More informationA CHARACTERIZATION OF TREE TYPE
A CHARACTERIZATION OF TREE TYPE LON H MITCHELL Abstract Let L(G) be the Laplacian matrix of a simple graph G The characteristic valuation associated with the algebraic connectivity a(g) is used in classifying
More informationGraphs and Network Flows IE411 Lecture 1
Graphs and Network Flows IE411 Lecture 1 Dr. Ted Ralphs IE411 Lecture 1 1 References for Today s Lecture Required reading Sections 17.1, 19.1 References AMO Chapter 1 and Section 2.1 and 2.2 IE411 Lecture
More informationPlanarity Planarity
Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?
More informationProblem Set 1 Solutions Math 109
Problem Set 1 Solutions Math 109 Exercise 1.6 Show that a regular tetrahedron has a total of twentyfour symmetries if reflections and products of reflections are allowed. Identify a symmetry which is
More informationOn a tree graph dened by a set of cycles
Discrete Mathematics 271 (2003) 303 310 www.elsevier.com/locate/disc Note On a tree graph dened by a set of cycles Xueliang Li a,vctor NeumannLara b, Eduardo RiveraCampo c;1 a Center for Combinatorics,
More informationS on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =
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
More informationFRACTIONAL COLORINGS AND THE MYCIELSKI GRAPHS
FRACTIONAL COLORINGS AND THE MYCIELSKI GRAPHS By G. Tony Jacobs Under the Direction of Dr. John S. Caughman A math 501 project submitted in partial fulfillment of the requirements for the degree of Master
More informationMath 443/543 Graph Theory Notes 4: Connector Problems
Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we
More informationColoring Eulerian triangulations of the projective plane
Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@unilj.si Abstract A simple characterization
More informationPartitioning edgecoloured complete graphs into monochromatic cycles and paths
arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edgecoloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political
More informationOn Total Domination in Graphs
University of Houston  Downtown Senior Project  Fall 2012 On Total Domination in Graphs Author: David Amos Advisor: Dr. Ermelinda DeLaViña Senior Project Committee: Dr. Sergiy Koshkin Dr. Ryan Pepper
More informationMinimum Bisection is NPhard on Unit Disk Graphs
Minimum Bisection is NPhard on Unit Disk Graphs Josep Díaz 1 and George B. Mertzios 2 1 Departament de Llenguatges i Sistemes Informátics, Universitat Politécnica de Catalunya, Spain. 2 School of Engineering
More informationBOUNDARY EDGE DOMINATION IN GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 04874, ISSN (o) 04955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 19704 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationHigh degree graphs contain largestar factors
High degree graphs contain largestar factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationColor fixation, color identity and the Four Color Theorem
Color fixation, color identity and the Four Color Theorem Asbjørn Brændeland I argue that there is no 4chromatic planar graph with a joinable pair of color identical vertices, i.e., given a 4chromatic
More informationGraph. Consider a graph, G in Fig Then the vertex V and edge E can be represented as:
Graph A graph G consist of 1. Set of vertices V (called nodes), (V = {v1, v2, v3, v4...}) and 2. Set of edges E (i.e., E {e1, e2, e3...cm} A graph can be represents as G = (V, E), where V is a finite and
More information