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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
ME test series question on graph theory
0
votes
76
views
graphtheory
asked
Jan 17
in
Graph Theory
by
Shankar Kakde
(
195
points)

76
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
by
Priyadrasta Raut
(
387
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.4k
points)

284
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
in
Graph Theory
by
srestha
Veteran
(
115k
points)

108
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
in
Graph Theory
by
Na462
Loyal
(
6.8k
points)

84
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
in
Graph Theory
by
pps121
Active
(
1.5k
points)

104
views
discretemathematics
graphtheory
virtualgatetestseries
0
votes
0
answers
5
Gateforum Test Series: Graph Theory  Graph Matching
asked
Jan 2
in
Graph Theory
by
Gupta731
Active
(
4.6k
points)

67
views
gateforumtestseries
discretemathematics
graphtheory
graphmatching
0
votes
0
answers
6
Zeal Test Series 2019: Graph Theory  Degree Of Graph
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such that there is a vertex of degree 1, a vertex of degree 2, a ... a vertex of degree 6 and a vertex of degree 7. Which of the following can be the degree of the last vertex ____ ?
asked
Jan 2
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.5k
points)

75
views
zeal
discretemathematics
graphtheory
degreeofgraph
zeal19
+1
vote
1
answer
7
Zeal Test Series 2019: Graph Theory  Graph Matching
asked
Dec 22, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.5k
points)

95
views
zeal
discretemathematics
graphtheory
graphmatching
zeal2019
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
Standard Videos for Calculus
Standard Videos for Linear Algebra
Standard Videos for Graph Theory
Standard Videos for Combinatory
Standard Videos for Set Theory & Algebra
All categories
General Aptitude
1.8k
Engineering Mathematics
7.3k
Discrete Mathematics
5.1k
Mathematical Logic
2.1k
Set Theory & Algebra
1.3k
Combinatory
879
Graph Theory
805
Probability
987
Linear Algebra
682
Calculus
493
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6.1k
Compiler Design
2.1k
Operating System
4.2k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.6k
Others
1.8k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
Recent Blog Comments
I will add the videos link soon.
video link ?
I think no need to add GO classroom content...
For combinatorics , can add balls and bin...
Yes, and it is really helpful for us. Thanks
50,288
questions
55,719
answers
192,113
comments
90,125
users