Introduction to proof and discrete mathematics
Trees and connectivity
Connected and acyclic, the edge count that follows, the four equivalent descriptions, and the spanning tree inside every connected graph.
About 25 minutes6 activities Paper packet
Introduction to proof and discrete mathematics
Connected and acyclic, the edge count that follows, the four equivalent descriptions, and the spanning tree inside every connected graph.
About 25 minutes6 activities Paper packet