Class notes
vertex connectivity Edge connectivity Matchings and Coverings Coverings
- Course
- Institution
This is the beast curse for student
[Show more]
Seller
Follow
bilal-guma
Content preview
Department of Mathematics Elementary Graph Theory Lecture 9 Vertex connectivity
The vertex connectivity h0 (G ) of a graph G is the minimum number of
vertices whose removal disconnects the graph G or makes it isomorphic to
the trivial graph K1 .
Ex:
1. h0 (G ) 0 iff G is disconnected. h0 ( Forest graph) 1
2. h0 (G ) 1 iff G has a cut-vertex or G K 2 h0 ( Pn ) 1
3. h0 (G ) 2 . h0 (Cn ) 2
4. h0 ( K n ) n 1 , h0 ( K 4 ) 3
5. h0 ( K m, n ) min{m, n} , , h0 ( K 4, 2 ) min{4, 2} 2
6. h0 ( petersen graph) 3
Note: h0 (G ) (G ) .
Edge connectivity
The edge connectivity h1 (G ) of a graph G is the minimum number of
edges whose removal disconnects the graph G .
Ex:
1. h1 (G ) 0 iff G is disconnected. h1 ( Forest graph) 1
2. h0 (G ) 1 iff G has a cut-edge h1 ( Pn ) 1
3. h1 (G ) 2 . h1 (Cn ) 2
4. h0 ( K n ) n 1 , h1 ( K 4 ) 3
5. h1 ( K m, n ) min{m, n} , , h1 ( K 4, 2 ) min{4, 2} 2
6. h1 ( petersen graph) 3
Dr. Didar A. Ali 1
, Department of Mathematics Elementary Graph Theory Lecture 9
Note: h1 (G ) (G ) .
Theorem: For any simple graph G, h0 (G ) h1 (G ) (G ) .
Theorem: For all integers a, b, and c, such that 0 a b c , there exist a graph G
with, h0 (G ) a , h1 (G ) b and (G ) c .
Ex: Construct a graph G in which h0 (G ) 2 , h1 (G ) 4 and (G ) 6 .
A graph G
v1 has the minimum degree which is 6, thus (G ) 6
Removing the two vertices v1 and v1 disconnected the graph G it means h0 (G ) 2 .
Removing the foure edges e1 , e2 , e3 and e4 disconnected the graph G it means
h1 (G ) 4 .
Theorem: Among all graphs of order p and size q, the maximum vertex
2q
connectivity h0 (G ) 0 , if q p 1 and h0 (G ) , where q p 1 .
p
Dr. Didar A. Ali 2
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller bilal-guma. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $2.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
79223 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now