Dark Mode

Recent questions tagged undirected-graph

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

1 vote

2 answers

2

CMI2016-A-5
A dodecahedron is a regular solid with $12$ faces, each face being a regular pentagon. How many edges are there? And how many vertices? $60$ edges and $20$ vertices $30$ edges and $20$ vertices $60$ edges and $50$ vertices $30$ edges and $50$ vertices

go_editor asked in Graph Theory Dec 30, 2016

557 views

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

Recent questions tagged undirected-graph