menu
Recent questions tagged graph-theory
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged graph-theory
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged graph-theory
0
votes
0
answers
65
views
Introduction to Discrete Mathematics- Graph Theory
thinlamb
asked
in
Mathematical Logic
Aug 24, 2021
by
thinlamb
5
points
65
views
graph-theory
discrete-mathematics
0
votes
0
answers
108
views
#bfs #test-series
Find the number of possible BFS ordering for the graph given below. [Starting from node 1]
Abhishek tarpara
asked
in
DS
Aug 18, 2021
by
Abhishek tarpara
13
points
108
views
bfs
graph-theory
trees
data-structures
algorithms
0
votes
0
answers
28
views
ACE Discrete Maths Text Book; Graph Theory; Page 100, question 18.
subhashchaganti
asked
in
Graph Theory
Jul 14, 2021
by
subhashchaganti
5
points
28
views
graph-theory
discrete-mathematics
engineering-mathematics
0
votes
0
answers
32
views
Self-Doubt Graph theory book Rosen or Narsingh Deo
ykrishnay
asked
in
Graph Theory
Jun 30, 2021
by
ykrishnay
103
points
32
views
graph-theory
discrete-mathematics
engineering-mathematics
engineering-maths
0
votes
0
answers
32
views
graph theory
On a gate paper 2015 set 2 Q26 CS of 2 marks theres a question about self complementary graph, what is the meaning of congruent to 0 mod 4, 1 mod 4
Chama hage
asked
in
Mathematical Logic
Jun 26, 2021
by
Chama hage
5
points
32
views
graph-theory
0
votes
0
answers
85
views
Kenneth Rosen Exercise 10.4 question 25 Graph Connectivity
ami_c05
asked
in
Graph Theory
Apr 26, 2021
by
ami_c05
5
points
85
views
kenneth-rosen
discrete-mathematics
graph-theory
1
vote
0
answers
27
views
GATE graph theory
How many non-isomorphic graphs are possible with 6 edges 6 vertices each having a degree of 2? 2 4 5 6
donniedarko
asked
in
Graph Theory
Mar 9, 2021
by
donniedarko
39
points
27
views
graph-theory
self-doubt
0
votes
1
answer
97
views
Dominating set and Independent set.
Please explain the basic difference between Independent set and Dominating Set?
arpit_18
asked
in
Graph Theory
Feb 21, 2021
by
arpit_18
5
points
97
views
graph-theory
discrete-mathematics
0
votes
0
answers
22
views
BOOKNAME : GRAPH THEORY, CHAPTER: CONNECTEDNESS COMPLETE, REGULAR AND BIPARTITE GRAPHS
chssktejaswini
asked
in
Study Resources
Feb 20, 2021
by
chssktejaswini
5
points
22
views
graph-theory
1
vote
2
answers
685
views
GATE CSE 2021 Set 1 | Question: 16 | Video Solution
Arjun
asked
in
Graph Theory
Feb 18, 2021
by
Arjun
1.4k
points
685
views
gate2021-cse-set1
graph-theory
graph-planarity
numerical-answers
easy
3
votes
2
answers
719
views
GATE CSE 2021 Set 1 | Question: 36 | Video Solution
Arjun
asked
in
Graph Theory
Feb 18, 2021
by
Arjun
1.4k
points
719
views
gate2021-cse-set1
graph-theory
graph-connectivity
1
vote
1
answer
48
views
Ace Test Series
consider a cycle graph of 4 vertices and needs to perform the vertex coloring using 4 colors. The maximum number of vertex colorings possible is (Answer given as 68)
Satish Chandra
asked
in
Graph Theory
Jan 24, 2021
by
Satish Chandra
9
points
48
views
graph-theory
0
votes
1
answer
56
views
What is total number of planer graph can be formed with 6 vertices ?
subhadip997
asked
in
Graph Theory
Jan 11, 2021
by
subhadip997
9
points
56
views
graph-theory
discrete-mathematics
0
votes
2
answers
457
views
ACE test Series
Suppose that a tree T has N1 vertices of degree 1, 2 vertices of degree 2 , 4 vertices of degree 3 And 3 vertices of degree 4. Number of vertices in the tree is ? Answer given is 21
wander
asked
in
DS
Dec 22, 2020
by
wander
301
points
457
views
graphs
graph-theory
1
vote
1
answer
115
views
Made easy test series
is this statement true? in a graph with unique edge weight the spanning tree of second lowest weight is unique. I am not not able to come up with the example to prove it wrong .
agastya_08
asked
in
Algorithms
Oct 30, 2020
by
agastya_08
11
points
115
views
algorithms
spanning-tree
graph-theory
mst
1
vote
1
answer
94
views
Self doubt - Graph Connectivity (NPTEL & PY)
Let G be a graph with n vertices and if every vertex has a degree of at least $\frac{n−1}{2}$ then G is connected. Source : https://gateoverflow.in/1221/gate2007-23 Let G be a graph with n vertices and if every vertex has a degree of at ... then G is connected. source : https://nptel.ac.in/courses/106/106/106106183/ My doubt : Which one is right?
KUSHAGRA गुप्ता
asked
in
Graph Theory
Sep 17, 2020
by
KUSHAGRA गुप्ता
1.4k
points
94
views
discrete-mathematics
graph-theory
0
votes
1
answer
80
views
Self Doubt - Planar graph (PY)
$K_5$ is non-planar. I am showing you my proof. Please tell me whether this is the right way or not to prove that $K_5$ is non-planar. $\sum$ (deg)$=4+4+4+4+4=20$ $e=10$ and $n=5$ Assume $K_5$ is planar. $v-e+r=2$ ... $K_5$ is non-planar. If this is the right way, why this method didn't work in this graph. Source: https://gateoverflow.in/87129/gate1990-3-vi
KUSHAGRA गुप्ता
asked
in
Graph Theory
Sep 15, 2020
by
KUSHAGRA गुप्ता
1.4k
points
80
views
discrete-mathematics
graph-planarity
graph-theory
self-doubt
0
votes
4
answers
101
views
#DM #Graphs labeled simple graphs
How to count number of labeled simple graphs? Please explain!
mamtuj
asked
in
Graph Theory
Aug 16, 2020
by
mamtuj
-25
points
101
views
self-doubt
graph-theory
graph
0
votes
0
answers
35
views
Textbook questions #doubt
What should be the answer?
premu
asked
in
Graph Theory
Jul 22, 2020
by
premu
163
points
35
views
graph-theory
0
votes
1
answer
160
views
Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Chapter 4 Question 27
dararirum
asked
in
Graph Theory
Jun 23, 2020
by
dararirum
5
points
160
views
discrete-mathematics
graph-theory
graph-isomorphism
0
votes
1
answer
347
views
Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Chapter 2 Question 21
dararirum
asked
in
Others
Jun 23, 2020
by
dararirum
5
points
347
views
discrete-mathematics
graph-theory
0
votes
1
answer
50
views
Self doubt GRAPH THEORY
Abhipsa
asked
in
Graph Theory
May 31, 2020
by
Abhipsa
17
points
50
views
graph-theory
discrete-mathematics
0
votes
1
answer
485
views
Find no of Hamiltonian cycles in kn,n
How many Hamiltonian cycles are there in complete bipartite graph K n,n
SANDEEP1729
asked
in
Graph Theory
May 9, 2020
by
SANDEEP1729
5
points
485
views
hamiltonian-graph
graph-theory
combinatory
0
votes
1
answer
49
views
Trees self doubt
S1: A tree with n vertices which has no vertices of degree 2 must have at least leaves S2: The number of trees on 5 labelled vertices is 125. Which of the following statements is true? (A). Only S1 (B). Only S2 (C). Only S1 and S2 (D). None of the above
Abhipsa
asked
in
Graph Theory
May 8, 2020
by
Abhipsa
17
points
49
views
graph
trees
graph-theory
0
votes
1
answer
53
views
Hamiltonian Graph
Consider the following Graphs: S1: Graph with vertices and each vertex has degree S2: Graph with 20 vertices such that for every 2 vertices Which of the following represents hamilton graph? (A). Only S1 (B). Only S2 (C). Both S1 and S2 (D). Neither S1 nor S2
Abhipsa
asked
in
Graph Theory
May 8, 2020
by
Abhipsa
17
points
53
views
graph-theory
discrete-mathematics
0
votes
0
answers
56
views
Matching Number
Please tell me what is the Independence Number Domination Number Matching Number Covering Number of the given graph in the picture. Does perfect matching exist in the given graph?
Abhipsa
asked
in
Graph Theory
May 7, 2020
by
Abhipsa
17
points
56
views
discrete-mathematics
graph-theory
1
vote
0
answers
219
views
Havell Hakimi Algorithm - Graph Theory
The Havell Hakimi Algorithm Requires the sorting of the degree sequence and later marking and subtracting according to that order. Does this means that the vertex with the highest degree will always have an edge with the vertex with the second ... I have noticed that without sorting the algorithm doesn't give correct output so I think it is a necessary step)
nilotpola
asked
in
Mathematical Logic
May 4, 2020
by
nilotpola
9
points
219
views
discrete-mathematics
graph-theory
graph
0
votes
0
answers
38
views
Graph theory 3-Ordered trees possible for a given no of nodes
ramcharantej_24
asked
in
Graph Theory
Apr 28, 2020
by
ramcharantej_24
13
points
38
views
trees
combinatory
graph-theory
discrete-mathematics
graph
0
votes
1
answer
46
views
Number of perfect matching in Kn?
Find number of perfect matching in Kn where n is even? Please explain too?
darshansharma_
asked
in
Graph Theory
Apr 23, 2020
by
darshansharma_
5
points
46
views
discrete-mathematics
graph-theory
0
votes
1
answer
67
views
Why Euler circuit does not exist when number of odd degree vertices is 2
darshansharma_
asked
in
Graph Theory
Apr 23, 2020
by
darshansharma_
5
points
67
views
discrete-mathematics
graph-theory
0
votes
1
answer
27
views
What is the degree of region?
What is the degree of region r4? How you find it?
darshansharma_
asked
in
Graph Theory
Apr 22, 2020
by
darshansharma_
5
points
27
views
graph-theory
discrete-mathematics
0
votes
0
answers
32
views
GATE2012-38 Video Solution
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$
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
32
views
gate2012
graph-theory
normal
marks-to-all
counting
video-solution
0
votes
0
answers
19
views
GATE1994-1.6, ISRO2008-29 Video Solution
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
19
views
gate1994
graph-theory
combinatory
normal
isro2008
counting
video-solution
0
votes
0
answers
23
views
GATE2014-1-51 Video Solution
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
23
views
gate2014-1
graph-theory
numerical-answers
normal
graph-connectivity
video-solution
0
votes
0
answers
21
views
GATE2018-30 Video Solution
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ is ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
21
views
gate2018
graph-theory
graph-search
normal
video-solution
0
votes
0
answers
23
views
GATE2007-23 Video Solution
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on $90$ vertices. The complement of a cycle on $25$ vertices. None of the above
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
23
views
gate2007
graph-theory
normal
graph-connectivity
video-solution
0
votes
0
answers
33
views
GATE2002-1.25, ISRO2008-30, ISRO2016-6 Video Solution
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
33
views
gate2002
graph-theory
easy
isro2008
isro2016
graph-connectivity
video-solution
0
votes
0
answers
21
views
GATE2003-36 Video Solution
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
21
views
gate2003
graph-theory
graph-matching
normal
video-solution
0
votes
0
answers
19
views
GATE2016-2-03 Video Solution
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
19
views
gate2016-2
graph-theory
graph-coloring
normal
numerical-answers
video-solution
0
votes
0
answers
25
views
GATE2006-71 Video Solution
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 number of vertices of degree zero in $G$ is: $1$ $n$ $n + 1$ $2^n$
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
25
views
gate2006
graph-theory
normal
degree-of-graph
video-solution
Page:
1
2
3
4
next »
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts