The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
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.
Search results for graphtheory
+29
votes
5
answers
1
GATE201238
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to 15 30 90 360
asked
Sep 12, 2014
in
Graph Theory
by
gatecse
Veteran
(
13.6k
points)

3.7k
views
gate2012
graphtheory
normal
markstoall
counting
+4
votes
1
answer
2
Graph Theory conceptual
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 vertex of degree 3, a vertex of degree ... a vertex of degree 7. Which of the following can be the degree of the last vertex? (A) 3 (B) 0 (C) 5 (D) 4
asked
Nov 13
in
Graph Theory
by
Parshu gate
Loyal
(
3.7k
points)

33
views
graphtheory
discretemathematics
+3
votes
1
answer
3
Graph Theory
Graph G(V,E) is a connected planar graph with no cycle of length less than 4 edges, if V = 15 then maximum value of E is: The answer given is 26.
asked
Nov 13
in
Graph Theory
by
Shubhanshu
Veteran
(
11.3k
points)

81
views
discretemathematics
graphtheory
graphconnectivity
+3
votes
1
answer
4
Discrete maths: Graph theory [Test series]
asked
Nov 15
in
Graph Theory
by
rahul sharma 5
Veteran
(
17.7k
points)

69
views
graphtheory
discretemathematics
graphconnectivity
+3
votes
0
answers
5
Graph Theory:Planarity
Q.Suppose that a connected planar simple graph has 20 vertices,each of degree 3.Into how many regions does a representation of this planar graph split the plane ? ............................................................................................................ Here I am getting number of faces =36 doesn't it represent the region.?
asked
4 days
ago
in
Graph Theory
by
junaid ahmad
Boss
(
9.6k
points)

44
views
graphtheory
+10
votes
4
answers
6
GATE2017223
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
asked
Feb 14
in
Graph Theory
by
Madhav
Active
(
2k
points)

2.1k
views
gate20172
graphtheory
numericalanswers
degreeofgraph
+13
votes
4
answers
7
GATE200672
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in $G$ is: $\binom{\frac{n}{2}}{2}.2^{\frac{n}{2}}$ $2^{n2}$ $2^{n3}\times 3$ $2^{n1}$
asked
Apr 24, 2016
in
Graph Theory
by
jothee
Veteran
(
99.2k
points)

1.2k
views
gate2006
graphtheory
normal
degreeofgraph
+1
vote
2
answers
8
GARPH THEORY
Q.A tree has n2 vertices of degree 2,n3 vertices of degree 3.....and nk vertices of degree k.How many vertices of degree 1 does it have ? a)n2+2n4+3n5+.......+(k2)nk+1 b)n2+2n3+3n4+.......+(k1)nk c)n3+2n4+3n5+.......+(k2)nk+2 d)None of the above
asked
4 days
ago
in
Graph Theory
by
junaid ahmad
Boss
(
9.6k
points)

32
views
graphtheory
+1
vote
1
answer
9
DIscrete maths: Graph theory
Number of subgraphs possible with K4? Given answer is 106 .I think 112 is correct?
asked
Nov 16
in
Graph Theory
by
rahul sharma 5
Veteran
(
17.7k
points)

80
views
graphtheory
discretemathematics
+1
vote
1
answer
10
#Graph theory #coloring
How to find number of ways for coloring a graph with 'm' colors for following graphs a)connected graph(with no cycles) b)regular graph
asked
3 days
ago
in
Graph Theory
by
Harish Karnam
Active
(
1.1k
points)

29
views
graphtheory
graphcoloring
+12
votes
5
answers
11
GATE2016203
The minimum number of colours that is sufficient to vertexcolour any planar graph is ________.
asked
Feb 12, 2016
in
Graph Theory
by
Akash Kanase
Veteran
(
46.8k
points)

2.3k
views
gate20162
graphtheory
graphcoloring
normal
numericalanswers
+2
votes
0
answers
12
Graph colouring
Consider a tree with n nodes where and node can adjacent to maximum 4 other nodes .then what is the minimum number of colours needed to colour the tree so that no two adjacent nodes get the same colour
asked
Nov 13
in
Graph Theory
by
Parshu gate
Loyal
(
3.7k
points)

32
views
graphtheory
+2
votes
0
answers
13
Graph Theory paths
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. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?
asked
Nov 13
in
Graph Theory
by
Parshu gate
Loyal
(
3.7k
points)

24
views
graphtheory
+1
vote
1
answer
14
Self Doubt
How many distinct unlabelled simple graphs (connected or disconnected), having n nodes, are possible?
asked
Nov 14
in
Programming
by
Rachit Agarwal
(
137
points)

22
views
graphtheory
datastructure
0
votes
1
answer
15
graphs and trees conceptual
asked
6 days
ago
in
Graph Theory
by
Parshu gate
Loyal
(
3.7k
points)

31
views
graphtheory
0
votes
1
answer
16
Graph
asked
Nov 17
in
Mathematical Logic
by
Prateek kumar
Boss
(
7.2k
points)

36
views
graphtheory
discretemathematics
0
votes
0
answers
17
Graph Theory
Hi All, For graph theory i have 2 sources, Rosen's Ebook and Narsingh Deo's Graph Theory which i issued from my college's library and I am confused what to refer? Deo's book has much more detailed explanations, but Rosen also seems decent, Which would be better?
asked
2 days
ago
in
Mathematical Logic
by
Namit Dhupar
Junior
(
701
points)

18
views
studyresources
graphtheory
0
votes
0
answers
18
Algorithm: Multistage graphs
Can someone share some multistage graph where dijkstra will fail but DP works correct?
asked
5 days
ago
in
Algorithms
by
rahul sharma 5
Veteran
(
17.7k
points)

50
views
graphtheory
algorithms
+1
vote
1
answer
19
Cut Sets in graph
Question: Number of cut sets possible a tree with 10 vertices _________ My approach : Number of edges in a tree with 10 vertices = 9. Each of these can be considered as a cut set as deleting one edge necessarily disconnects the graph. Also any combination (I mean ... cut sets = 2^9  1 = 511. But the answer is written 9. Apparently they are not considering the super sets. Why?
asked
Nov 9
in
Graph Theory
by
humblefool
Junior
(
695
points)

59
views
engineeringmathematics
graphtheory
discretemathematics
cut
settheory&algebra
+1
vote
0
answers
20
Graph Theory: Degree of a region
In the given following planar graph, what is the degree of the region R1:
asked
Nov 13
in
Graph Theory
by
Manu Thakur
Veteran
(
28.7k
points)

48
views
graphtheory
discretemathematics
Page:
1
2
3
...
next »
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
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
Follow @csegate
Gatecse
Search results for graphtheory
Recent Blog Comments
yes isro should change their dates. This is very ...
Hi Guys, I think this is not correct. ISRO ...
NIELIT specifically mailed that they decided ...
is there any chances of changing the exam date??
ISRO and NIELIT Exam on the same day i.e 17th ...
29,157
questions
36,984
answers
92,161
comments
34,824
users