Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
virtual gate graph theory
Prince Sindhiya
asked
in
Graph Theory
Oct 15, 2018
327
views
0
votes
0
votes
i am getting 6 as answer
discrete-mathematics
graph-theory
Prince Sindhiya
asked
in
Graph Theory
Oct 15, 2018
by
Prince Sindhiya
327
views
answer
comment
Follow
share this
share
4 Comments
Show 8 previous comments
by
akash.dinkar12
commented
Oct 15, 2018
reply
Follow
share this
Four color theorem is there, So it is better to aware of this..
0
0
by
Magma
commented
Oct 15, 2018
reply
Follow
share this
Utkarsh Joshi
yeah I'm wrong !!
0
0
by
Prince Sindhiya
commented
Oct 15, 2018
reply
Follow
share this
Thnxx utkarsh ,Akash :)
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
pps121
asked
in
Graph Theory
Jan 9, 2019
487
views
Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following: 1. There is a vertex of degree smaller than $8$ in $G.$ 2. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it. Which of the following is TRUE: 1 only 2 only Both 1 and 2 Neither 1 nor 2
pps121
asked
in
Graph Theory
Jan 9, 2019
by
pps121
487
views
discrete-mathematics
graph-theory
virtual-gate-test-series
2
votes
2
votes
1
answer
2
Prince Sindhiya
asked
in
Graph Theory
Oct 15, 2018
725
views
Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Consider the following two statements$:$ The two graphs $G_{1}$ and $G_{2}$ are isomorphic Each of $G_{1}$ and $G_{2}$ are self-dual. Both $(i)$ and $(ii)$ are true Only $(i)$ is true Only $(ii)$ is true Both $(i)$ and $(ii)$ are false
Prince Sindhiya
asked
in
Graph Theory
Oct 15, 2018
by
Prince Sindhiya
725
views
discrete-mathematics
graph-theory
virtual-gate-test-series
0
votes
0
votes
1
answer
3
kunalv
asked
in
Graph Theory
Sep 10, 2017
308
views
Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Which of the following is true? The size of the maximum independent set on G is the same as the size of maximum clique on G'(Complement of G) The size of minimum vertex cover on G is the same as the size of maximum clique on G'(complement of G) The size of minimum vertex cover on G is the same as the size of maximum clique on G'
kunalv
asked
in
Graph Theory
Sep 10, 2017
by
kunalv
308
views
discrete-mathematics
graph-theory
virtual-gate-test-series
4
votes
4
votes
1
answer
4
Samujjal Das
asked
in
Graph Theory
Jan 24, 2017
912
views
Virtual Gate Test Series: Discrete Mathematics - Graph Theory (Complete Graph)
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let $G$ be a complete graph on $10$ ... vertices in $G.$ How many simple paths are there from $\text{u to v}$ going through $\text{w?}$
Samujjal Das
asked
in
Graph Theory
Jan 24, 2017
by
Samujjal Das
912
views
discrete-mathematics
graph-theory
complete-graph
virtual-gate-test-series
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Discrete Mathematics
(6.5k)
Mathematical Logic
(2.2k)
Set Theory & Algebra
(1.7k)
Combinatory
(1.5k)
Graph Theory
(994)
Probability
(1.2k)
Linear Algebra
(890)
Calculus
(716)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
