Recent questions tagged graph-theory
Register

Recent questions tagged graph-theory

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
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
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
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
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
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
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
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
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
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
0 votes
1 answer 50 views
Self doubt GRAPH THEORY
Abhipsa asked in Graph Theory May 31, 2020
by Abhipsa
17 points
50 views
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
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
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
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
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
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
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
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
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
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
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
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
Page:
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.
Developed by Chun