Register

PGEE 2018

678 views
1 votes
1 votes
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
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
2
Tesla! asked Apr 30, 2017
1,008 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 y What would be maximum path length between any two vertices of graph ?
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...
User Avatar
1 votes
1 votes
1 answer
3
Tesla! asked Apr 30, 2017
557 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 y Which vertex will have highest in degree ?
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...
User Avatar
3 votes
3 votes
3 answers
4
Tesla! asked Apr 30, 2017
1,172 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 y Find number of strongly connected components
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...
User Avatar
Link Copied!