search
Log In
4 votes
326 views

Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check

in Graph Theory 326 views
1
3 articulation pts A G F
0
ya 3 is right ans

2 Answers

5 votes
 
Best answer
F, A and G are articulation points.

selected by
0
why D or E not articulation point  ?
3
If removal of any vertex disconnects the graph that is articulation point or cut vertex

removing vertex F or A or G disconnects the graph so its articulation points

Removing D or E does not disconnects the graph.
0 votes

A vertex in an undirected connected graph is an articulation point (or cut vertex) iff removing it (and edges through it) disconnects the graph 

Graph is having 3 articulation point F ,A &  G

Related questions

5 votes
1 answer
2
1 vote
0 answers
3
827 views
This is in reference to the below question https://gateoverflow.in/473/gate2012-38 My doubt here is In this question, we can also solve like first we select 4 vertices out of 6 in 6C4 ways. Now we need to count how many cycles we can form with 4 vertices.And I think this is ... is (n-1)! /2 which evaluates to 3 in case of n=4.So by multiplication rule, total cycles we have 45.Is this way correct?
asked Jun 6, 2018 in Graph Theory Ayush Upadhyaya 827 views
2 votes
2 answers
4
813 views
I was searching for this question and found below link How many subgraphs does $K_5$ have? Here, in general, it is given to be $\displaystyle\sum_{r=0}^{n}\binom{n}{r}2^{\frac{r(r-1)}{2}}$ My doubt is that the case for $r=0$ is taken if we select none of the vertices of $K_n$? Why the case for $ r=0$ considered?
asked Jun 5, 2018 in Graph Theory Ayush Upadhyaya 813 views
...