menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
My GATE Preparation Story (AIR 4434 to AIR 101)
IIT(MS) interview experience
My GATE Preparation Experience (AIR 6 in GATE CS 2020) and Tips For Future Aspirants
IIT Madras MS in CSE Interview Experience
My GATE Preparation Experience (GATE CS 2020 AIR 188)
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Discrete Mathematics
(5.9k)
Mathematical Logic
(2.1k)
Set Theory & Algebra
(1.5k)
Combinatory
(1.4k)
Graph Theory
(844)
Probability
(1k)
Linear Algebra
(732)
Calculus
(600)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent Blog Comments
@Ankur Barick Yeah, I'd say the same - GATE...
You can check now for access..
Sir when will i get the access?
yes sir
Did you use a different email for payment?
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Ace Academy Test series
0
votes
86
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
Chaitrasj
86
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.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
3
votes
3
answers
1
198
views
ACE ACADEMY BOOKLET QUESTION
Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping 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$
Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping subsets $S$ and $T$. Which of the following is true? There are at least two edges that have one endpoint in ... point in $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
`JEET
198
views
2
votes
3
answers
2
159
views
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.
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 $\Leftrightarrow$ m and n ... $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
`JEET
159
views
2
votes
1
answer
3
137
views
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.
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$ $m$ $=$ $n$ ... $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
`JEET
137
views
graph-theory
discrete-mathematics
2
votes
1
answer
4
209
views
ace academy test series toc turing machine
asked
May 28, 2019
in
Theory of Computation
hitesh159
209
views
theory-of-computation
turing-machine
ace-test-series
...