GATE CSE
First time here? Checkout the FAQ!
x
0 votes
35 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 (76k points)   | 35 views

Please log in or register to answer this question.

Related questions



Top Users Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2606 Points

  5. Debashish Deka

    2088 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1312 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1166 Points

  10. Sanjay Sharma

    984 Points

Monthly Topper: Rs. 500 gift card

21,438 questions
26,753 answers
60,913 comments
22,926 users