Question

asd

Answer 1

. Evaluate: -3 - (-4) (3 points)

-7
-1
1
-12

answer mine and ill answer yours

Answer 2

hint: pick a vertex, and add edges and vertices until you span

Answer 3

@zzr0ck3r can u be more specific please?

Answer 4

Actually use induction.

HINTS

So a graph on 1 vertex is trivial

A spanning tree on a graph with 2 verts, for sure has one edge.

Now suppose you have a spanning tree on n vertices has n-1 edges

Take a spanning tree on n+1 vertices, it will have a vertex with degree 1

remove that vertex

Use inductive hypothesis

Answer 5

minimum spanning tree*

Answer 6

@zzr0ck3r thank u very much :)

Answer 7

np, love me some GT

Answer 8

@ItryMath lol