Recent questions tagged graph-connectivity

0 votes
2 answers
152
0 votes
1 answer
153
0 votes
1 answer
154
In a Bipartite graph,the size of the maximum matching is equal to the size of the minimum vertex cover ...can somebody prove this logically ?
1 votes
2 answers
155
1 votes
1 answer
156
1 votes
2 answers
157
Find 1) Vertex connectivity 2) Edge connectivity 3) Is it a seperable graph ? If so then find the cut-vertex
1 votes
1 answer
158
Find 1) Vertex connectivity 2) Edge connectivity 3) Is it a seperable graph ? If so then find the cut-vertex 4) Is {v1,v2,v5} a cut-set ?
0 votes
1 answer
162
Let N1 be the number of distinct cycles of length 3 in given graph and N2 be the number of distinct cycles of length 3, if the graph is labelled.Then N2 - N1 is _________...
0 votes
1 answer
165
Consider a simple connected undirected graph $G$ which has $m$ vertices and $n$ edges. Which of the following condition always guarantee that after removal of those numbe...
2 votes
1 answer
167
Assumed undirected graph G is connected. G has 6­vertices and 10 edges. Findthe minimum number of edges whose deletion from graph G is always guaranteethat ...
2 votes
2 answers
174
15 votes
4 answers
178
0 votes
0 answers
180
proof :- A connected graph any two paths of maximum length share at least one vertex