Let G be a graph of order n ≥ 3. Prove that G is 2-connected if and only if for any vertex v and edge e of G, v and e lie on a common cycle of G.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 74EQ
icon
Related questions
Question
Let G be a graph of order n ≥ 3. Prove that G is 2-connected if and only if
for any vertex v and edge e of G, v and e lie on a common cycle of G.
Transcribed Image Text:Let G be a graph of order n ≥ 3. Prove that G is 2-connected if and only if for any vertex v and edge e of G, v and e lie on a common cycle of G.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer