The Gateway to Computer Science Excellence
0 votes
66 views

how solve getting different answer???

in Graph Theory by (441 points) | 66 views
+1
Vertex connectivity means minimum no of vertices remove such that graph will be disconnected.

Edge connectivity means minimum no of edges remove such that graph will be disconnected.

in graph(a)   vertex connectivity=1(remove e vertex)  &   edge connectivity=1(remove d-e edge)

in graph(b)    vertex connectivity=1  &   edge connectivity=2

Please log in or register to answer this question.

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
50,654 questions
56,166 answers
193,872 comments
94,261 users