define a spanning tree hence find all the spanning trees of the graph given below
Answers
Answered by
0
Answer:
This is my first question on the Mathematics StackExchange site, so please do tell me if I have not adhered to any conventions in this post.
Ok, so if I have a graph G, with say 6 vertices and 7 Edges, how would I determine how many possible spanning tree's are there?
I know this is probably a very simple question, but I am very new to Graph Theory.
Thanks.
Similar questions