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!
Follow Math Help Forum on Facebook and Google+
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?
View Tag Cloud