0 0 votes closed with the note: Answered Prove that in a connected graph G a vertex v is a cut-vertex if and only if there exist two(or more) edges x and y incident on v such that no circuit in G includes both x and y. Graph Theory graph-theory narsingh-deo + – Ayush Upadhyaya 1.1k views comment Share Follow Print See all 4 Comments 4 4 Comments reply srestha commented Jun 2, 2018 reply Follow flag yes, I got it by taking a diagram Do u want just prove with diagram or want logically prove (I took like x,y are two connected edges and v is connecting point . x,y not making any circuit or end edges. So, when we delete v, automatically x,y will be disconnected) 1 1 replyShare Ayush Upadhyaya commented Jun 2, 2018 reply Follow flag @srestha-That would comprise of only single instance.For a proof, you know it should hold for all instance.A generic proof would be more welcoming. 0 0 replyShare Kushagra Chatterjee commented Jun 3, 2018 reply Follow flag Answer 2 2 replyShare Ayush Upadhyaya commented Jun 8, 2018 reply Follow flag Nice proof Kusharga :) 0 0 replyShare Please log in or register to add a comment.
