Register

PGEE 2018

920 views
1 1 vote
Consider Undirected Graph G

having vertex V {A,B,C,D,E}

and edge pair as E {AB BD BE AC CE CD}

A) Given graph is disconnected

B) Given graph is complete

C) Given graph has vertex connectivity 2

D) Given graph has edge connectivity 1

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · PGEE 2018Next → · PGEE 2018
← Previous in category · PGEE 2018Next in category → · ISRO CSE 2018 | Ques...
Position:
Show:

Related questions

0 0 votes
2 2 answers
885
885 views
Tesla! asked Apr 21, 2018
885 views
PGEE 2018
Maximal Independence Number is the cardinality of maximal independence set ( Independence set V of graph G is set in which no vertex of the set have a direct edge between...
0 0 votes
2 answers 2 answers
1.9k
1.9k views
Tesla! asked Apr 30, 2017
1,904 views
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 yWhat would be maximum path length bet...
1 1 vote
1 1 answer
972
972 views
Tesla! asked Apr 30, 2017
972 views
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 yWhich vertex will have highest in deg...
3 3 votes
3 answers 3 answers
2.5k
2.5k views
Tesla! asked Apr 30, 2017
2,503 views
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 yFind number of strongly connected com...