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
Ace Academy Test series
0
votes
60
views
If a 2 regular graph G has a perfect matching, then which of the following is NOT true?
1. G is a cycle graph
2. Chromatic number of G is 2
3. Every component of G is even cycle
4. G is a bipartite graph
asked
Jan 16, 2019
in
Graph Theory
by
Chaitrasj
Junior
(
969
points)

60
views
answer
comment
+1
1 seems the most suitable answer
0
Yes answer given is1st option
Why can't option 3 be answer? Why there will be a component of even cycle always?
Can you give some explanation like how you arrived at your answer?
+1
for perfect matching the necessary condition is the no of vertices should be even.
the graph being 2 regular implies the no of edges =no of vertices.
therefore the no of edges is even
having a graph with odd cycle violates the above conditions
0
Yes your explanation is right. But if every component of G is always an even cycle, means it's a cycle graph right... So how option 1 is becoming False under any certain case :(
What's the difference between option 1 and 3, I'm confused among them
+1
from my understanding a cycle graph consists of a single cycle.But our graph can contain multiple cycles and components.Hence 1 is the most suitable option
0
Yess we can have a graph with 2 components such that each component is $C_4$. In this case all other options are true, but 1 is becoming False it's not a cycle graph.. Thanks!
0
C4 is a 2 regular graph and cycle contain then how 1 statement is false?
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
3
answers
1
ACE ACADEMY BOOKLET QUESTION
Let $G$ $=$ $(V, E)$ be a simple nonempty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two nonempty and nonoverlapping subsets $S$ and $T$. Which of the following is true? There are at least two edges that ... $S$ and one end point in $T$ There are exactly one edge that have one end point in $S$ and one end point in $T$
asked
May 26, 2019
in
Graph Theory
by
`JEET
Boss
(
19k
points)

144
views
+2
votes
3
answers
2
Ace academy booklet #graph theory
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Euler circuit exists ... Euler circuit exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Euler circuit exits $\Leftrightarrow$ $n$ is even.
asked
May 26, 2019
in
Graph Theory
by
`JEET
Boss
(
19k
points)

90
views
+2
votes
1
answer
3
ACE ACADEMY BOOKLET
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Hamiltonian cycle exists for all n. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Hamiltonian cycle exists $\Leftrightarrow$ ... Hamiltonian cycle exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Hamiltonian cycle exits $\Leftrightarrow$ $n$ is even.
asked
May 26, 2019
in
Graph Theory
by
`JEET
Boss
(
19k
points)

85
views
graphtheory
discretemathematics
+1
vote
1
answer
4
ace academy test series toc turing machine
asked
May 28, 2019
in
Theory of Computation
by
hitesh159
(
181
points)

149
views
theoryofcomputation
turingmachine
acetestseries
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
While raising objections what works as...
It is mentioned "Left for Evaluation" so no...
I think this discussion will keep on going till...
do we have to include marks of qs that are left...
@roh6jmon yes, it is there.
50,737
questions
57,317
answers
198,367
comments
105,096
users