Dark Mode

Recent questions tagged connected-components

1 vote

1 answer

1

CMI2018-B-5
Let $G=(V,E)$ be an undirected graph and $V=\{1,2,\cdots,n\}.$ The input graph is given to you by a $0-1$ matrix $A$ of size $n\times n$ as follows. For any $1\leq i,j\leq n,$ the entry $A[i,j]=1$ if and only if ... any two vertices are connected to each other by paths. Give a simple algorithm to find the number of connected components in $G.$ Analyze the time taken by your procedure.

gatecse asked in Graph Theory Sep 13, 2019

427 views

3 votes

3 answers

2

PGEE 2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y Find number of strongly connected components

Tesla! asked in Graph Theory Apr 30, 2017

by Tesla!

1.1k views

3 votes

1 answer

3

GATE Overflow | Data Structures | Test 1 | Question: 18
The maximum number of possible edges in an undirected simple graph with $100$ vertices and $5$ components is ___

Arjun asked in DS Oct 10, 2016

by Arjun

511 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged connected-components