Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

Advertisement


Advertisement
Similar documents
Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Mathematical Induction

The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson)

3. Eulerian and Hamiltonian Graphs

Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.

Lesson 3. Algebraic graph theory. Sergio Barbarossa. Rome - February 2010

2.3 Scheduling jobs on identical parallel machines

Divisor graphs have arbitrary order and size

Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest.

Solutions to Exercises 8

Chapter 2 Paths and Searching

SCORE SETS IN ORIENTED GRAPHS

Math 443/543 Graph Theory Notes 4: Connector Problems

Combinatorics: The Fine Art of Counting

Chapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

CSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: Graphs. The Internet graph

Oriented Diameter of Graphs with Diameter 3

/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry

Chapter 4. Trees. 4.1 Basics

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

A 2-factor in which each cycle has long length in claw-free graphs

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

1 Basic Definitions and Concepts in Graph Theory

Graphs and Network Flows IE411 Lecture 1

Lecture 17 : Equivalence and Order Relations DRAFT

Chapter 6 Planarity. Section 6.1 Euler s Formula

Answers to some of the exercises.

Long questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and -3B.

10. Graph Matrices Incidence Matrix

Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.

Homework 15 Solutions

Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

COLORED GRAPHS AND THEIR PROPERTIES

Graph Theory Problems and Solutions

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005

Triangle deletion. Ernie Croot. February 3, 2010

Kings in Tournaments. Yu Yibo, Di Junwei, Lin Min

The edge slide graph of the n-dimensional cube

2-partition-transitive tournaments

Minimum Spanning Trees

Single machine parallel batch scheduling with unbounded capacity

Basic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by

Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes

Social Media Mining. Graph Essentials

Sample Problems in Discrete Mathematics

Graph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick

8. Matchings and Factors

Math 179: Graph Theory

A 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.

CMSC 451: Graph Properties, DFS, BFS, etc.

(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

GRAPH THEORY and APPLICATIONS. Trees

COT5405 Analysis of Algorithms Homework 3 Solutions

1 Definitions. Supplementary Material for: Digraphs. Concept graphs

On 2-vertex-connected orientations of graphs

Analysis of Algorithms, I

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Course on Social Network Analysis Graphs and Networks

CMPSCI611: Approximating MAX-CUT Lecture 20

SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE

CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Lecture 7. The Matrix-Tree Theorem. 7.1 Kircho s Matrix-Tree Theorem

4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests

Graphs without proper subgraphs of minimum degree 3 and short cycles

Introduction to Flocking {Stochastic Matrices}

Coloring Eulerian triangulations of the projective plane

CSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*

Labeling outerplanar graphs with maximum degree three

14. Trees and Their Properties

Section Summary. Introduction to Graphs Graph Taxonomy Graph Models

6.042/18.062J Mathematics for Computer Science October 3, 2006 Tom Leighton and Ronitt Rubinfeld. Graph Theory III

Chapter 2. Basic Terminology and Preliminaries

Extremal Wiener Index of Trees with All Degrees Odd

THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER

6.2 Permutations continued

Distributed Computing over Communication Networks: Maximal Independent Set

On Integer Additive Set-Indexers of Graphs

Disjoint Compatible Geometric Matchings

Math 421, Homework #5 Solutions

Lecture 16 : Relations and Functions DRAFT

Finding and counting given length cycles

A DIRAC TYPE RESULT ON HAMILTON CYCLES IN ORIENTED GRAPHS

Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

Connections between decomposition trees of 3-connected plane triangulations and hamiltonian properties

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

A counterexample to a result on the tree graph of a graph

INCIDENCE-BETWEENNESS GEOMETRY

On a tree graph dened by a set of cycles

Unicyclic Graphs with Given Number of Cut Vertices and the Maximal Merrifield - Simmons Index

Connectivity and cuts

Tree-representation of set families and applications to combinatorial decompositions

7. Colourings. 7.1 Vertex colouring

Midterm Practice Problems

Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR

arxiv: v1 [math.co] 7 Mar 2012

Advertisement
Transcription:

MCS-236: 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 of vertices and E is the set of arcs or directed edge. Each arc (u, v) is an ordered pair of distinct vertices u and v. We usually write uv for arc (u, v). For any vertices u and v, when both uv and vu are arcs we call them antiparallel arcs. Arc uv leaves u and enters v. An arc is incident to the vertex it leaves and the vertex it enters. The outdegree, od v, of vertex v is the number of arcs that leave v. The indegree, id v, of vertex v is the number of arcs that enter v. Let U and W be disjoint subsets of V. An arc uw, where u U and w W, is said to leave U and enter W. An oriented graph D is a digraph without antiparallel edges. In other words, it is derived from an undirected graph G by giving a direction to every edge of G. In this case, we say that D is an orientation of G. A directed version of an undirected graph G is a digraph that results from G by replacing every edge of G by a pair of antiparallel arcs joining the two ends previously joined by the replaced edge. An underlying graph of a digraph D is the graph that results from replacing every arc by an undirected edge (and keeping only one edge for every pair of resulting parallel edges). A digraph D 1 = (V 1, E 1 ) is a subdigraph of a digraph D 2 = (V 2, E 2 ) if V 1 V 2 and E 1 E 2. A symmetric digraph is a digraph such that if uv is an arc then vu is also an arc. Symmetric digraphs can be modeled by undirected graphs. Theorem (The First Theorem of Digraph Theory, Theorem 7.1 of CZ). Any digraph of order n and size m satisfies n 1 (od v i) = n 1 (id v i) = m. Proof. Each edge contributes 1 to the outdegree sum, and 1 to the indegree sum.

2 MCS-236: Handout #Ch7 Definitions. The following concepts for digraphs: walk, trail, path, length of a walk, closed walk, open walk, circuit, cycle, distance d(u, v) from u to v, geodesic, Eulerian trail, Eulerian circuit, Eulerian digraph, Hamiltonian path, Hamiltonian cycle, and Hamiltonian digraph, are defined in exactly same way as for undirected graphs. (To get the directed definitions, subsitute everywhere the term arc for edge in the undirected definitions.) Some digraph concepts are different from the undirected ones. For instance, there are at least three flavors of connectedness for digraphs: A digraph is (weakly) connected if its underlying graph is connected. A digraph is semi-connected if for any vertices u, v there s a u v path or a v u path. A digraph is strongly connected or strong if for any vertices u, v there s a u v path and a v u path. Or equivalently, if for any vertices u, v there s a u v path. Or equivalently, if there exists a vertex r such that for any vertex v there s a r v path and a v r path. Theorem (Theorem 7.2 of CZ). If a digraph D contains a u v walk of length l, then D contains a u v path of length at most l. Proof. (Sketch) Keep cutting cycles from the given walk until none remains. Theorem (Theorem 7.3 of CZ). A digraph D is strong if and only if D contains a closed spanning walk Proof. : Assume D strong. Label the vertices v 1, v 2,...,v n. Since D is strong, for each 1 i < n, there s a v i v i+1 path; and there s also a v n v 1 path. Concatenating these n paths gives a closed spanning walk. : Let W be a closed spanning walk. Let u and v be arbitrary vertices. Since W is spanning, both u and v are on W and there s a subwalk of W from u to v. By Theorem 7.2 there s a u v path. Therefore, D is strong. Theorem (Theorem 7.4 of CZ). A nontrivial connected digraph D is Eulerian if and only if od v = id v for every vertex v of D Proof. Similar to the proof for undirected graphs.

MCS-236: Handout #Ch7 3 Theorem (Robbins, Theorem 7.5 of CZ). A nontrivial connected graphs G has a strong orientation if and only if G contains no bridge, i.e., G is 2-edge-connected. Proof. (Sketch) Depth-first search G. Direct each tree edge downward and direct each back edge upward. Tournaments Definitions. A tournament is an orientation of a complete graph, i.e., it is a digraph such that for any distinct vertices u, v, exactly one of uv and vu is an arc. A tournament is transitive if uw is an arc whenever both uv and vw are arcs. Theorem (Theorem 7.6 of CZ). A tournament is transitive if and only if it contains no cycles. Proof. : Assume tournament T is transitive but contains a cycle v 1, v 2,...,v k, v 1. If k = 2, then T contains antiparallel arcs v 1 v 2 and v 2 v 1, contradicting T being a tournament. Thus, k 3. Since v 1 v 2 and v 2 v 3 are arcs, transitivity implies v 1 v 3 is an arc. Now that we know v 1 v 3 is an arc, and since v 3 v 4 is an arc, again transitivity implies v 1 v 4 is an arc. We reason like this k 2 times to conclude that v 1 v k is an arc. However, v k v 1 is also an arc of the digraph (since it s part of the cycle). Thus, T contains antiparallel arcs v 1 v k and v k v 1, contradicting T being a tournament. : Assume tournament T contains no cycle. Suppose T contains arcs uv and vw. We know u w since T cannot contain antiparallel arcs. The tournament cannot have wu as arc because if it did it would contain the cycle u, v, w, u. Since it s a tournament and u w, either uw or wu is an arc. Thus, uw is an arc. Hence, T is transitive. Theorem (Theorem 7.7 of CZ). If u is a vertex of maximum outdegree in a tournament, then d(u, v) 2 for every vertex v. Proof. Let u be a vertex of maximum outdegree in a tournament T. Assume for the sake of contradiction that some vertex y satisfies d(u, y) 3. Define V 1 = { x V (T) : d(u, x) = 1 }. Then od u = V 1, u / V 1, y u, and y / V 1. No arc can leave {u} V 1 and enter y since existence of any such arc would make d(u, y) 2, contradicting d(u, y) 3. Since T is a tournament, any two distinct vertices have exactly one arc joining them.

4 MCS-236: Handout #Ch7 Hence, for each w {u} V 1, there s an arc yw. Thus, od y {u} + V 1 = 1 + od u, contradicting u having maximum outdegree. Theorem (Theorem 7.8 of CZ). Every tournament contains a Hamiltonian path. Proof. Let T be a tournament. We prove by induction on the order n of T. Recall that Hamiltonian path means spanning path. If n = 1, then T is trivial and it has a trivial path that s also spanning. If n = 2, then T is an oriented K 2, and it contains a path of length 1 that spans T. Suppose n 3 and assume inductively that any tournament of order n 1 contains a spanning path. Let x be a vertex of T. Then T x is a tournament of order n 1. By inductive assumption, T x contains a spanning path. Say P : v 1, v 2,...,v n 1 is a spanning path of T x. Path P is a path in T as well. If xv 1 is an arc of T, then x, P is a spanning path in T and we are done. If v n 1 x is an arc of T, then P, x is a spanning path in T and we are done. So assume from now on that xv 1 / E(T) and v n 1 x / E(T). Since T is a tournament, it follows that v 1 x E(T) and xv n 1 E(T). Moreover, for each i, where 2 i n 2, either v i x E(T) or xv i E(T), but not both. Now, arc v 1 x enters x and arc xv n 1 leaves x. Therefore, there exists some j such that 1 j n 2, v j x E(T), and xv j+1 E(T). We now have v 1, v 2,...,v j, x, v j+1,...,v n 1 as a path that spans T. Theorem (Theorem 7.9 of CZ). Every vertex in a nontrivial strong tournament belongs to some triangle. Proof. Let v be a vertex in a nontrivial, strong tournament T. Define U = { u V (T) : vu E(T) } and W = { w V (T) : wv E(T) }. Since T is a nontrivial strong tournament, some arc enters v and some arc leaves v. Thus, U and W. Clearly, {{v} U W } V (T) since v V (T) and U and W are defined as subsets of V (T). Let x V (T). If x = v, then x {v}. Suppose x v. Since T is a tournament, either xv is an arc and vx is an arc, but not both. Thus, x U or x W. Hence, V (T) {{v} U W }. Therefore, V (T) = {v} U W.

MCS-236: Handout #Ch7 5 Moreover, v / U W by the definition of U and W. Also, U W = because if there were any vertex x such that x U W, then both vx and xv are arcs, contradicting T being a tournament. Thus { {v}, U, W } is a partition of V (T). Since T is strong, any vertex in U can reach v via some path. Such a path exists since U. Such a path must have at least one arc that leaves U because v / U. Any arc leaving U either enters v or enters W since {{v}, U, W } is a partition of V (T). Now, there can be no arc uv leaving U and entering v, because such an arc together with arc vu that is known to exist would give a pair of antiparallel arcs, contradicting T being a tournament. Therefore, some arc leaves U and enters W. Let uw be such an arc. We now have a triangle v, u, w, v. Definitions. A digraph D of order n 3 is vertex-pancyclic if for every vertex v and for every l = 3, 4,..., n, digraph D has a cycle of length l containing v. Theorem (Moon s Theorem). Every nontrivial strong tournament is vertex-pancyclic. Proof. Induction on cycle length l, where the base case holds by Theorem 7.9. Theorem (Theorem 7.10 of CZ). A nontrivial tournament T is Hamiltonian if and only if T is strong. Proof. (Sketch) : A spanning cycle allows any vertex to reach any other vertex via an arc of the cycle. : By Moon s Theorem. Theorem (Theorem 7.11 of CZ). If T is a strong tournament of order 4, then there exists a vertex v such that T v is a strong tournament. Proof. By Moon s Theorem.