GATE CSE
First time here? Checkout the FAQ!
x
0 votes
43 views

Let $G$ be a connected graph. For a vertex $x$ of $G$ we denote by $G−x$ the graph formed by removing $x$ and all edges incident on $x$ from $G$. $G$ is said to be good if there are at least two distinct vertices $x, y$ in $G$ such that both $G − x$ and $G − y$ are connected.

  1. Given a good graph, devise a linear time algorithm to find two such vertices.

 

asked in Graph Theory by Veteran (78.2k points)   | 43 views

Please log in or register to answer this question.

Related questions



Top Users Jul 2017
  1. Bikram

    3946 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1842 Points

  4. joshi_nitish

    1650 Points

  5. Arjun

    1268 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1100 Points

  8. Shubhanshu

    1052 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    692 Points


24,016 questions
30,946 answers
70,303 comments
29,332 users