Recent content by Kipster1203

So me and my partner got these photosensors as part of our project and were testing them today and got some weird results.. We started by shining a blue LED and the voltage output would drop over time. we then hooked up the green LED and the voltage would rise over time... From the spec...

yes, that is one example. But the question asks for the minimum size.

Oh because it says u and v are distinct, so the smallest that could exist would have length 2

a path of length 1?

The number of vertices is the defined as the order of a graph. A graph is said to be connected when a path exists between every pair of vertices?

that they are connected. Size is the number of edges right? So if the subgraph only contained adjacent u and v, then wouldn't the minimum size be 1?

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? and does this suggest another question?