Graph Theory: Cuts and Connectivity

Slides:



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

 Theorem 5.9: Let G be a simple graph with n vertices, where n>2. G has a Hamilton circuit if for any two vertices u and v of G that are not adjacent,
Chapter 8 Topics in Graph Theory
Edge-connectivity and super edge-connectivity of P 2 -path graphs Camino Balbuena, Daniela Ferrero Discrete Mathematics 269 (2003) 13 – 20.
EMIS 8374 Vertex Connectivity Updated 20 March 2008.
Chapter 9 Connectivity 连通度. 9.1 Connectivity Consider the following graphs:  G 1 : Deleting any edge makes it disconnected.  G 2 : Cannot be disconnected.
Graph Theory Ming-Jer Tsai. Outline Text Book Graph Graph Theory - Course Description The Topics in the Class Evaluation.
k-Factor Factor: a spanning subgraph of graph G
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set S  V(G) such that G-S has more than one component. a b c d e f g h i.
Connectivity and Paths
Mycielski’s Construction Mycielski’s Construction: From a simple graph G, Mycielski’s Construction produces a simple graph G’ containing G. Beginning with.
Internally Disjoint Paths Internally Disjoint Paths : Two paths u to v are internally disjoint if they have no common internal vertex.
Graph Theory Ming-Jer Tsai. Outline Graph Graph Theory Grades Q & A.
Definition Hamiltonian graph: A graph with a spanning cycle (also called a Hamiltonian cycle). Hamiltonian graph Hamiltonian cycle.
Matchings Matching: A matching in a graph G is a set of non-loop edges with no shared endpoints Maximal Matching: A maximal matching in a graph is a matching.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that S has more than one component. Connectivity of G ((G)): The.
Internally Disjoint Paths
Internally Disjoint Paths
A 2-Approximation algorithm for finding an optimum 3-Vertex-Connected Spanning Subgraph.
Factor Factor: a spanning subgraph of graph G
Factor Factor: a spanning subgraph of graph G k-Factor: a spanning k-regular subgraph Odd component: a component of odd order o(H): the number of odd components.
Internally Disjoint Paths Internally Disjoint Paths : Two paths u to v are internally disjoint if they have no common internal vertex. u u v v Common internal.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
Problem: Induced Planar Graphs Tim Hayes Mentor: Dr. Fiorini.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that G-S has more than one component. d f b e a g c i h.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
Introduction to Graph Theory
Subdivision of Edge In a graph G, subdivision of an edge uv is the operation of replacing uv with a path u,w,v through a new vertex w.
3.3 Matchings and Factors: Matchings in General Graphs This copyrighted material is taken from Introduction to Graph Theory, 2 nd Ed., by Doug West; and.
CSE, IIT KGP Graph Theory: Introduction Pallab Dasgupta Dept. of CSE, IIT
Chapter 1 Fundamental Concepts II Pao-Lien Lai 1.
4.1 Connectivity and Paths: Cuts and Connectivity
CSNB143 – Discrete Structure Topic 9 – Graph. Learning Outcomes Student should be able to identify graphs and its components. Students should know how.
4.2 k-connected graphs This copyrighted material is taken from Introduction to Graph Theory, 2 nd Ed., by Doug West; and is not for further distribution.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
CSE, IIT KGP Graph Coloring. CSE, IIT KGP K-coloring A k-coloring of G is a labeling f:V(G)  {1,…,k}.A k-coloring of G is a labeling f:V(G)  {1,…,k}.
Connectivity and Paths 報告人:林清池. Connectivity A separating set of a graph G is a set such that G-S has more than one component. The connectivity of G,
Week 1 – Introduction to Graph Theory I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Chapter 6 Connectivity and Flow 大葉大學 資訊工程系 黃鈴玲
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
4.2 k-connected graphs This copyrighted material is taken from Introduction to Graph Theory, 2 nd Ed., by Doug West; and is not for further distribution.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Hamiltonian Cycles Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Introduction to Graph Theory
4.2 k-connected graphs This copyrighted material is taken from Introduction to Graph Theory, 2 nd Ed., by Doug West; and is not for further distribution.
Graph Theory Ming-Jer Tsai. Outline Graph Graph Theory Grades Q & A.
CSE, IIT KGP Graph Theory: Introduction Pallab Dasgupta Dept. of CSE, IIT
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Trees Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT
1 Assignment #3 is posted: Due Thursday Nov. 15 at the beginning of class. Make sure you are also working on your projects. Come see me if you are unsure.
Chromatic Coloring with a Maximum Color Class Bor-Liang Chen Kuo-Ching Huang Chih-Hung Yen* 30 July, 2009.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Planarity Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT.
12. Lecture WS 2012/13Bioinformatics III1 V12 Menger’s theorem Borrowing terminology from operations research consider certain primal-dual pairs of optimization.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Matchings and Factors Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
MCA 520: Graph Theory Instructor Neelima Gupta
Subgraphs Lecture 4.
Grade 11 AP Mathematics Graph Theory
Chapter 5 Fundamental Concept
Introduction of graph theory
Graph Theory and Algorithm 01
Planarity Testing.
V17 Metabolic networks - Graph connectivity
V11 Metabolic networks - Graph connectivity
Hamiltonian Cycles.
V12 Menger’s theorem Borrowing terminology from operations research
Planarity.
V11 Metabolic networks - Graph connectivity
Graph Theory: Proof Techniques
Graph Theory: Euler Graphs and Digraphs
Graph Theory: Degree Sequences and Digraphs
V11 Metabolic networks - Graph connectivity
Presentation transcript:

Graph Theory: Cuts and Connectivity Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in

Vertex Cut and Connectivity A separating set or vertex cut of a graph G is a set S  V(G) such that GS has more than one component. A graph G is k-connected if every vertex cut has at least k vertices. The connectivity of G, written as (G), is the minimum size of a vertex cut.

Edge-connectivity A disconnecting set of edges is a set F E(G) such that G – F has more than one component. A graph is k-edge-connected if every disconnecting set has at least k edges. The edge connectivity of G, written as '(G), is the minimum size of a disconnecting set.

Edge Cut Given S,T V(G), we write [S,T] for the set of edges having one endpoint in S and the other in T. An edge cut is an edge set of the form [S,S], where S is a nonempty proper subset of V(G).

Results (G)  (G)  (G) If S is a subset of the vertices of a graph G, then: |[S,S]| = [vS d(v)] – 2e(G[S]) If G is a simple graph and |[S,S]| < (G) for some nonempty proper subset S of V(G), then |S| > (G).

More results… A graph G having at least three vertices is 2-connected if and only if each pair u,vV(G) is connected by a pair of internally disjoint u,v-paths in G. If G is a k-connected graph, and Gis obtained from G by adding a new vertex y adjacent to at least k vertices in G, then Gis k-connected.

And more … If n(G)  3, then the following conditions are equivalent (and characterize 2-connected graphs) G is connected and has no cut vertex. For all x,y V(G), there are internally disjoint x,y-paths For all x,y V(G), there is a cycle through x and y. (G)  1, and every pair of edges in G lies on a common cycle

x,y-separator Given x,y  V(G), a set S  V(G)  {x,y} is an x,y-separator or a x,y-cut if GS has no x,y-path. Let (x,y) be the minimum size of an x,y-cut. Let (x,y) be the maximum size of a set of pair-wise internally disjoint x,y-paths. Let (G) be the largest k such that (x,y)  k for all x,y V(G). For X,Y V(G), an X,Y-path is a path having first vertex in X, last vertex in Y, and no other vertex in XY.

Menger’s Theorem If x,y are vertices of a graph G and x,yE(G), then the minimum size of an x,y-cut equals the maximum number of pair-wise internally disjoint x,y-paths. [Corollary] The connectivity of G equals the maximum k such that (x,y)  k for all x,yV(G). The edge connectivity of G equals the maximum k such that (x,y)  k for all x,yV(G).