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
ME test series question on graph theory
0
votes
88
views
graphtheory
asked
Jan 17, 2019
in
Graph Theory
by
Shankar Kakde
(
195
points)

88
views
answer
comment
0
b?
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
Is answer C?
answered
Jan 18, 2019
by
Priyadrasta Raut
Junior
(
511
points)
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
1
answer
1
Question on graph theory
Please explain how did they get that equation in E and V.
asked
Jan 5, 2016
in
Graph Theory
by
shikharV
Active
(
3.5k
points)

296
views
graphtheory
engineeringmathematics
+1
vote
1
answer
2
Made easy Test Series:Graph Theory+Automata
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n1}$, where each $a_{i}$ is $0$ or $1$ ... and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
asked
May 23, 2019
in
Graph Theory
by
srestha
Veteran
(
119k
points)

150
views
madeeasytestseries
graphtheory
theoryofcomputation
0
votes
0
answers
3
Ace Test Series: Graph Theory  Cut Edges
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
asked
Jan 19, 2019
in
Graph Theory
by
Na462
Loyal
(
7k
points)

98
views
graphtheory
acetestseries
0
votes
0
answers
4
Virtual Gate Test Series: Discrete Mathematics  Graph Theory
Let $G$ be a graph on $n$ vertices with $4n16$ 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
asked
Jan 9, 2019
in
Graph Theory
by
pps121
Active
(
1.5k
points)

121
views
discretemathematics
graphtheory
virtualgatetestseries
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
@Susheel It will be 1250 only,because when you...
In set A, Little endian question answer given...
What about this...
Compared to previous years...was this paper...
sure buddyy..
50,737
questions
57,279
answers
198,173
comments
104,840
users