can you please assist with following question:

prove or disprove: if G is a connected graph with cut-vertices

and u and v are vertices of G such that d(u,v) is

equal to diam G, then no block of G contains both u

and v. Thanks!(Bow)

Printable View

- Aug 23rd 2012, 01:52 PMKramerGraph Theory Question 2
can you please assist with following question:

prove or disprove: if G is a connected graph with cut-vertices

and u and v are vertices of G such that d(u,v) is

equal to diam G, then no block of G contains both u

and v. Thanks!(Bow) - Aug 23rd 2012, 11:51 PMVlasevRe: Graph Theory Question 2
It will be easier to help you if you provide us with some of your work so far. What have you done/tried so far? Where has it failed?