Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by ashutoshsharma
0
votes
0
answers
1
discrete
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then ∑(i=1 to m) eG(Ci−S) is (1) ≤m (2) ≥5m (3) ≥3m
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote t...
273
views
asked
Sep 27, 2017
0
votes
0
answers
2
DISCRETE
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then eG(Ci,S) is (A) Even (B) Odd (C) Cannot say
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote t...
372
views
asked
Sep 21, 2017
Graph Theory
graph-connectivity
+
–
0
votes
1
answer
3
DISCRETE
Let T be a tree with n vertices and k be the maximum size of an independent set in T. Then the size of maximum matching in T is (A) k (B) n−k (C) (n−1)/2
Let T be a tree with n vertices and k be the maximum size of an independent set in T. Then the size of maximum matching in T is(A) k(B) n−k(C) (n−1)/2
473
views
asked
Sep 21, 2017
Graph Theory
graph-matching
+
–
0
votes
1
answer
4
DISCRETE
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
398
views
asked
Sep 21, 2017
Graph Theory
vertex-cover
+
–
0
votes
0
answers
5
DISCRETE
In a class of 4 students, four committees are formed ( see the table below). Is it possible to choose a president for each committee so that no student is a president of more than one committee? Committee Members C1 Amit, Bimal, Dipak C2 Bimal, Dipak C3 Bimal, Chandan C4 Amit, Bimal, Chandan Yes No
In a class of 4 students, four committees are formed ( see the table below). Is it possible to choose a president for each committee so that no student is a president of ...
252
views
asked
Sep 21, 2017
Combinatory
combinatory
+
–
1
votes
1
answer
6
discrete
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
1.1k
views
asked
Sep 21, 2017
Graph Theory
vertex-cover
+
–
0
votes
0
answers
7
discrete mathematics
Let T be an n - vertex tree having one vertex of degree i for i=2,3,…,k and the remaining n−k+1 vertices are of degree 1 each. Determine n in terms of k.
Let T be an n - vertex tree having one vertex of degree i for i=2,3,…,k and the remaining n−k+1 vertices are of degree 1 each. Determine n in terms of k.
409
views
asked
Sep 14, 2017
Graph Theory
graph-connectivity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register