Register

Discrete

196 views
1 votes
1 votes
Let G=(V,E) be a simple graph. Let S⊂V and [S,S¯] be a smallest edge cut of G. Then a tight lower bound for ∣∣[S,S¯]∣∣ is

(a)  n-1

(b) κ(G)

(c) δ(G)
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
RahulVerma3 asked Mar 30
72 views
Discrete Mathematics | Relations | Equivalence relation |
The relation R on the set {(a, b) |a, b € Z} where (a, b)R(c, d) means a = c or b = d. Is R a equivalence relation or not ?
The relation R on the set {(a, b) |a, b € Z} where (a, b)R(c, d) means a = c or b = d. Is R a equivalence relation or not ?
User Avatar
1 votes
1 votes
1 answer
3
Phantom5 asked Sep 2, 2018
399 views
Which book to refer for Digital Logic and Discrete Maths? I'm from computer science prep. for GATE 2019
I need strict advice and guidance on this. All my other subjects syllabus and preparation covered. Only these two remained and I'm wondering. Somebody Suggested me to buy...
User Avatar
1 votes
1 votes
1 answer
4
mathematics asked Oct 19, 2017
315 views
Discrete
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
User Avatar
Link Copied!