Quick questions on Minimum spanning trees and Prim's algorithm: VCE General Mathematics Unit 4 Networks and decision mathematics

Q: What is wrong edge count?

A spanning tree of n vertices has exactly n - 1 edges. Too many means a cycle, too few means it is disconnected.

1short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.

What is wrong edge count?

Show answer

A spanning tree of

n

vertices has exactly

n - 1

edges. Too many means a cycle, too few means it is disconnected.

Have a question we have not covered?

This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.

All General MathematicsQ&A pages