(a) Let u and v be distinct vertices in a connected graph G. There may be...

Transcribed Image Text:

(a) Let u and v be distinct vertices in a connected graph G. There may be several connected subgraphs of G containing u and v. What is the minimum size of a connected subgraph of G containing u and v? Explain your answer. (b) Does the question in (a) suggest another question to you? (a) Let u and v be distinct vertices in a connected graph G. There may be several connected subgraphs of G containing u and v. What is the minimum size of a connected subgraph of G containing u and v? Explain your answer. (b) Does the question in (a) suggest another question to you?