Let u and v be distinc 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?(adsbygoogle = window.adsbygoogle || []).push({});

and does this suggest another question?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Help with graph theory

Loading...

Similar Threads - Help graph theory | Date |
---|---|

Graph Theory Help! | Aug 2, 2011 |

Need help – Graph Theory | Oct 13, 2010 |

The graph theory HELP | Apr 8, 2009 |

A graph problem - need help | May 14, 2007 |

Help in interpreting a graph - | Sep 4, 2006 |

**Physics Forums - The Fusion of Science and Community**