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
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
Recent questions in Graph Theory
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Web Page
Connectivity,
Matching,
Coloring.
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
0
votes
1
answer
1
Graph theory
In tree for every pair of vertices u!=v in G their is exactly 1 path from u to v .Please help me to prove this
asked
1 day
ago
in
Graph Theory
by
Shivangi Parashar 2
(
41
points)

20
views
0
votes
2
answers
2
Graph theory Modified
What is the maximum integer value m such that every simple connected graph with r vertices and r+2 edges contains at least m different spanning trees ? 1)1 2)4 3)8 4)m
asked
5 days
ago
in
Graph Theory
by
srestha
Veteran
(
92k
points)

125
views
graphtheory
discretemathematics
0
votes
1
answer
3
Ace material
If a graph with 10 vertices having each vertex having degree >=5 find graph connected or disconnected
asked
Aug 8
in
Graph Theory
by
gparamesh.1997
(
17
points)

17
views
0
votes
0
answers
4
Graph Theory
[closed]
asked
Aug 6
in
Graph Theory
by
BharathiCH
(
83
points)

14
views
0
votes
0
answers
5
Show that T is a maximum spanning tree for G
asked
Jul 24
in
Graph Theory
by
abram19000
(
7
points)

25
views
graphtheory
graphalgorithms
0
votes
1
answer
6
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
asked
Jul 24
in
Graph Theory
by
abhishek1995_cse
(
27
points)

64
views
graphtheory
graphconnectivity
+1
vote
1
answer
7
ACE Bits And Bytes
Number of perfect matching in Wn (n>=4 and n is even) _________.
asked
Jul 24
in
Graph Theory
by
abhishek1995_cse
(
27
points)

26
views
graphtheory
graphmatching
gate2019
0
votes
0
answers
8
SELF DOUBT
https://gateoverflow.in/510/gate199101xv IN THIS QUESTION I AM SOLVING LIKE THIS WE HAVE K COMPONENTS 1,2,3,.................K EACH OF WHICH HAVE N1,N2,N3,.................NK VERTICES SO TOTAL NUMBER OF EDGES ARE N1(N11)/2 +N2(N21)/2...................NK(NK1)/2 SO AT SOMEWHERE IN STEPS I REACHED TO 1/2((N)+N12+N22.......NK2)) NOT GETTING FURTHER FROM HERE ..................
asked
Jul 19
in
Graph Theory
by
eyeamgj
Active
(
3.5k
points)

21
views
0
votes
1
answer
9
Graphs
asked
Jul 18
in
Graph Theory
by
HeadShot
Junior
(
657
points)

44
views
0
votes
1
answer
10
Graphs
I think ans is option C , But will anybody explain the notation used in option D ?
asked
Jul 18
in
Graph Theory
by
HeadShot
Junior
(
657
points)

32
views
0
votes
1
answer
11
me test
A simple graph with n vertices is constructed by randomly and independently placing an edge between every two vertices with probability p. What is the expected no. of nodes with degree 2?
asked
Jul 17
in
Graph Theory
by
ronin_codex
(
7
points)

31
views
probability
graphtheory
expectation
simplegraph
+1
vote
0
answers
12
Graph Theory
asked
Jul 15
in
Graph Theory
by
Bhagyashree Mukherje
Junior
(
999
points)

50
views
testbooktestseries
0
votes
0
answers
13
graph theory
10.A graph G has any two vertices connected by exactly one path. Find the Number of ways we can properly colour G it we are provided with 10 colours.
asked
Jul 14
in
Graph Theory
by
poojasharma123
(
81
points)

75
views
graphtheory
0
votes
0
answers
14
UGC NET JULY 2018 Q81
asked
Jul 10
in
Graph Theory
by
Sanjay Sharma
Boss
(
48.8k
points)

55
views
+1
vote
1
answer
15
SELF DOUBT PREFIX
WE CAN USE STACK TO EVALUATE PREFIX EXPRESSION .THIS STATEMENT IS TRUE OR FALSE IF THEN HOW?? EXPRESSION IS +  * 2 3 5 / ^ 2 3 4
asked
Jul 8
in
Graph Theory
by
eyeamgj
Active
(
3.5k
points)

41
views
0
votes
0
answers
16
kenneth rosen
Given n+1 symbols x1,x2,...,xn,xn+1 appearing 1, f1,f2,...,fn times in a symbol string, respectively, where fj is the jth Fibonacci number, what is the maximum number of bits used to encode a symbol when all possible tiebreaking selections are considered at each stage of the Huffman ... of symbols should be n+1 i.e 7 (in this case ansewr is 8)or n i.e 6( in this case answer is 6)???
[closed]
asked
Jul 8
in
Graph Theory
by
eyeamgj
Active
(
3.5k
points)

53
views
0
votes
1
answer
17
SELF DOUBT DM ROSEN
Find the least number of comparisons needed to sort ﬁve element. I AM GETTING 7 AS (LOG 5!) =7........
asked
Jul 8
in
Graph Theory
by
eyeamgj
Active
(
3.5k
points)

30
views
0
votes
1
answer
18
rosen
asked
Jul 7
in
Graph Theory
by
eyeamgj
Active
(
3.5k
points)

49
views
0
votes
0
answers
19
Gate 2018 Qn. 43
Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1,2,…,100. There is an edge between vertices and if and only if the label of can be obtained by swapping two adjacent numbers in the label of . Let denote the degree of a vertex in G, and denote the number of connected components in G. Then, y + 10z = _____.
asked
Jul 6
in
Graph Theory
by
Optimus Prime
(
425
points)

35
views
graphtheory
+1
vote
1
answer
20
self doubt
in a rooted tree if we are asked to find the level of root then it should be 0 or 1 or question depending ??
asked
Jul 5
in
Graph Theory
by
eyeamgj
Active
(
3.5k
points)

29
views
0
votes
0
answers
21
How to find even or odd cylce in a graph
asked
Jun 30
in
Graph Theory
by
ejaz
(
217
points)

27
views
graphcoloring
0
votes
2
answers
22
self doubt
Is it necessary that euler graph should always be simple graph?
asked
Jun 27
in
Graph Theory
by
Vegeta
(
187
points)

48
views
discretemathematics
graphtheory
0
votes
0
answers
23
Kenneth rosen
How many nonisomorphic directed graphs are there with $n$ vertices when $n$ is $2$ $3$ $4$
asked
Jun 18
in
Graph Theory
by
swati96
(
37
points)

29
views
engineeringmathematics
discretemathematics
kennethrosen
graphtheory
0
votes
0
answers
24
Kenneth rosen
How many nonisomorphic graphs are there with six vertices and four edges?
asked
Jun 18
in
Graph Theory
by
swati96
(
37
points)

12
views
engineeringmathematics
discretemathematics
graphtheory
0
votes
0
answers
25
Graphs, kenneth rosen
How many nonisomorphic simple graphs are there with five vertices and three edges?
asked
Jun 18
in
Graph Theory
by
swati96
(
37
points)

16
views
engineeringmathematics
discretemathematics
kennethrosen
graphtheory
0
votes
0
answers
26
Graphs, kenneth rosen
How many nonisomorphic simple graphs are there with five vertices and three edges?
[closed]
asked
Jun 18
in
Graph Theory
by
swati96
(
37
points)

12
views
engineeringmathematics
discretemathematics
graphtheory
0
votes
1
answer
27
spanning tree
How we get maximum no. of spanning tree for give $n$ node is $n^{(n2)}$
asked
Jun 18
in
Graph Theory
by
piya
(
191
points)

26
views
engineeringmathematics
discretemathematics
graphtheory
0
votes
1
answer
28
Perfect Matching
Perfect matching is a set of edges such that each vertex appears only once and all vertices appear at least once (EXACTLY one appearance). So for n vertices perfect matching will have n/2 edges and there won't be any perfect matching if n is odd. ... 't know whether i got it properly or not. Can please anybody explain the Perfect matching in a complete graph with simpler examples ?
asked
Jun 10
in
Graph Theory
by
Na462
Active
(
4.5k
points)

37
views
graphmatching
0
votes
1
answer
29
True/False
Which of the following statements related to graphs are True? Consider a graph with Positive distinct edges 1.If we add a Positive Integer to all edges, then there are chances to get more than one shortest paths between 2 vertices 2.If we add a Positive Integer ... 4.If we add a Negative Integer to all edges, then there are chances to get more than one longest paths between 2 vertices
asked
Jun 9
in
Graph Theory
by
Balaji Jegan
Active
(
1.4k
points)

55
views
algorithms
graphtheory
djikstra
0
votes
0
answers
30
[414]Connectivity Narsingh Deo
Show that a simple graph is nonseparable iff for any two given arbitrary edges a circuit can always be found that will include these two edges.
asked
Jun 8
in
Graph Theory
by
Ayush Upadhyaya
Boss
(
11k
points)

32
views
graphtheory
narsinghdeo
Page:
1
2
3
4
5
6
...
21
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
Members at the site
mainaksen
POSHAN
Venus tyagi
Shubhgupta
Saurabh singh second
rajputved
Recent Posts
Donation (Kerala Flood)
Schedule for GATE 2019
GATE 2019 official website
Correct way of preparation
Right process to start solving MCQs in Comp.Sc.
All categories
General Aptitude
1.3k
Engineering Mathematics
5.5k
Discrete Mathematics
3.8k
Mathematical Logic
1.6k
Set Theory & Algebra
964
Combinatory
670
Graph Theory
624
Probability
672
Linear Algebra
542
Calculus
393
Digital Logic
2.1k
Programming & DS
4k
Algorithms
3.4k
Theory of Computation
4.2k
Compiler Design
1.6k
Operating System
3k
Databases
3.1k
CO & Architecture
2.7k
Computer Networks
3.1k
Non GATE
1.1k
Others
1.4k
Admissions
501
Exam Queries
450
Tier 1 Placement Questions
19
Job Queries
62
Projects
12
Follow @csegate
Gatecse
Recent questions in Graph Theory
Recent Blog Comments
Sir I have ordered GO PDF on 16 Aug 2018 still ...
gate overflow books are awesome; every one should ...
Books are there but don't think any will leave ...
Sir i have placed the order Details are PAYMENT ...
Sir i am placing order for gate overflew book ...
38,115
questions
45,621
answers
132,330
comments
49,305
users