Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged graph-connectivity
1
vote
0
answers
1
DRDO CSE 2022 Paper 1 | Question: 11
Consider the following graph. Find closeness centrality of $\text{‘A’}$ node.
admin
asked
in
Graph Theory
Dec 15, 2022
by
admin
70
views
drdocse-2022-paper1
graph-theory
graph-connectivity
5-marks
descriptive
1
vote
0
answers
2
DRDO CSE 2022 Paper 1 | Question: 13
Consider the following graph. Which nodes form the cliques of size $3?$
admin
asked
in
Graph Theory
Dec 15, 2022
by
admin
62
views
drdocse-2022-paper1
graph-theory
graph-connectivity
5-marks
descriptive
1
vote
0
answers
3
TIFR CSE 2022 | Part B | Question: 10
Consider the assertions $\text{(A1)}$ Given a directed graph $G$ with positive weights on the edges, two special vertices $s$ and $t$, and an integer $k$ - it is $\text{NP}$-complete to determine if $G$ has an $s- t$ path of length at most $k$ ... $\text{A1}$ does not imply $\text{A2}$ and $\text{A2}$ does not imply $\text{A1}$ None of the above.
admin
asked
in
Algorithms
Sep 1, 2022
by
admin
102
views
tifr2022
algorithms
graph-connectivity
p-np-npc-nph
1
vote
1
answer
4
TIFR CSE 2022 | Part B | Question: 14
Let $G$ be a directed graph (with no self-loops or parallel edges) with $n \geq 2$ vertices and $m$ edges. Consider the $n \times m$ incidence matrix $M$ of $G$, whose rows are indexed by the vertices of $G$ and the columns by the edges of $G$ ... . Then, what is the rank of $M?$ $m-1$ $m-n+1$ $\lceil m / 2\rceil$ $n-1$ $\lceil n / 2\rceil$
admin
asked
in
Graph Theory
Sep 1, 2022
by
admin
156
views
tifr2022
graph-theory
graph-connectivity
rank-of-matrix
0
votes
0
answers
5
Best Open Video Playlist for Graph Theory: Connectivity Topic | Discrete Mathematics
Please list out the best free available video playlist for Graph Theory: Connectivity Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll then select the best playlist and add to ... ones are more likely to be selected as best. For the full list of selected videos please see here
makhdoom ghaya
asked
in
Study Resources
Aug 15, 2022
by
makhdoom ghaya
68
views
missing-videos
free-videos
video-links
go-classroom
graph-theory
graph-connectivity
3
votes
1
answer
6
GO Classes Scholarship 2023 | Test | Question: 8
In a directed graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$, two nodes $u$ and $v$ are strongly connected if and only if they are mutually reachable i.e. there is a path from u to $v$ and a path from $v$ to $u$. ... connected components $\dots?$ can not increase can not decrease by more than $1$ can not decrease by more than $2$ may remain unchanged
GO Classes
asked
in
Graph Theory
Aug 7, 2022
by
GO Classes
386
views
goclasses-scholarship-test1
goclasses
graph-theory
graph-connectivity
multiple-selects
1-mark
4
votes
2
answers
7
GO Classes Scholarship 2023 | Test | Question: 9
Consider the following graph $\text{G:}$ Let $\text{M, C, I, S, B, E}$ be the Matching number, chromatic number, independence number, Clique number, Vertex cover number, and edge cover number, respectively of $\text{G}.$ What is $\text{M+C+I+S+B+E}?$
GO Classes
asked
in
Graph Theory
Aug 7, 2022
by
GO Classes
410
views
goclasses-scholarship-test1
numerical-answers
goclasses
graph-theory
graph-connectivity
vertex-cover
2-marks
3
votes
1
answer
8
GO Classes Scholarship 2023 | Test | Question: 10
For which of the following does there exist a graph satisfying the specified conditions? A tree with six vertices and six edges. A tree with three or more vertices, two vertices of degree one, and all the other vertices with degree three or ... with $10$ vertices and $8$ edges. A disconnected graph with $12$ vertices and $11$ edges and no cycle.
GO Classes
asked
in
Graph Theory
Aug 7, 2022
by
GO Classes
263
views
goclasses-scholarship-test1
goclasses
graph-theory
graph-connectivity
multiple-selects
2-marks
0
votes
2
answers
9
MadeEasy Test Series
There are 15 vertices and 15 edges in some graph. Now, these edges are arranged in such a way that maximum number of connected components are created in the graph. Find the connected components created. (A) 8 (B) 9 (C) 10 (D) 11 Please explain your answer.
anupamsworld
asked
in
DS
Jul 8, 2022
by
anupamsworld
382
views
made-easy-test-series
data-structures
graph-theory
graph-connectivity
0
votes
1
answer
10
Doubt:
Let “m” be the number of edges, “n” the number of vertices and “k” the number of connected components of a graph G. Prove that: $\left ( n-k \right )\leq m\leq \frac{\left ( n-k \right )\left ( n-k+1 \right )}{2}$ Why least number of edges are $\left ( n-k \right )$ and Why most number of edges are $\frac{\left ( n-k \right )\left ( n-k+1 \right )}{2}$ ? What is the idea behind this prove?
RKM
asked
in
Graph Theory
Jun 28, 2022
by
RKM
221
views
graph-connectivity
0
votes
0
answers
11
Introduction to Graph Theory Exercises
This is the problem snapshot
AngshukN
asked
in
Graph Theory
May 22, 2022
by
AngshukN
243
views
graph-theory
graph-connectivity
discrete-mathematics
14
votes
5
answers
12
GATE CSE 2022 | Question: 20
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
Arjun
asked
in
Graph Theory
Feb 15, 2022
by
Arjun
3.9k
views
gatecse-2022
numerical-answers
graph-theory
graph-connectivity
1-mark
Page:
1
2
3
4
5
6
...
9
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
BITSHD 2023
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(845)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged graph-connectivity
Recent Blog Comments
Please provide some tips about NET, since I want...
Amazing story to hear
Link added now:...
Sir can you please provide some good resources...
Where can we see the responses of the form filled?