The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Gateforum Test Series: Graph Theory  Graph connectivity
0
votes
103
views
discretemathematics
graphtheory
gateforumtestseries
graphconnectivity
asked
Oct 29, 2018
in
Graph Theory
by
Gupta731
Active
(
4.8k
points)
edited
Mar 15, 2019
by
ajaysoni1924

103
views
answer
comment
0
c option???
0
Yes C, G1 and G3 are bipartite.
There is a property mentioned by them.
"A bipartite graph doesn't have any odd length cycle"  Is that a valid property?
+2
A graph is bipartite iff it has no oddlength cycle,
we can prove also
0
Hmm, Thank You
0
Option c is Correct ???
0
Chromatic Number should be 2.
0
Yes @dilip
The question is not asking for chromatic number.
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+3
votes
0
answers
1
Zeal Test Series 2019: Graph Theory  Graph Connectivity
i didn't read the concept related to strongly connected components please it describe it for this question
asked
Nov 11, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.9k
points)

140
views
zeal
graphtheory
discretemathematics
graphconnectivity
zeal2019
0
votes
0
answers
2
MadeEasy Test Series: Graph Theory  Graph Connectivity
if m=4 and n=6 (complete graph) option B says removal of mC2n+2 = 66+2=2 edges. but it needs 3 edges to make the graph disconnected. how B is answer?
asked
Dec 8, 2016
in
Graph Theory
by
Anusha Motamarri
Boss
(
12k
points)

187
views
madeeasytestseries
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
+1
vote
1
answer
3
Ace Test Series: Graph Theory  Graph Connectivity
I think the explanation is for edges for which graph is always connected.
asked
Jan 24, 2016
in
Graph Theory
by
Tushar Shinde
Active
(
2.2k
points)

208
views
acetestseries
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
0
votes
0
answers
4
Gateforum Test Series: Graph Theory  Graph Matching
asked
Jan 2, 2019
in
Graph Theory
by
Gupta731
Active
(
4.8k
points)

90
views
gateforumtestseries
discretemathematics
graphtheory
graphmatching
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Discrete Mathematics
5.2k
Mathematical Logic
2.1k
Set Theory & Algebra
1.4k
Combinatory
916
Graph Theory
824
Probability
1k
Linear Algebra
723
Calculus
592
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.4k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
Cut off will be between 95115 not more than that.
@saxena0612 , Sir since they are not considering...
Hey Everyone! Those who think that they are...
Which questions are u challenging..?
ONLY T MADE EASY STUDENTS CAN UNDERSTAND,
50,737
questions
57,370
answers
198,506
comments
105,272
users