MathCastle
Sign up
Graph TheoryEasyTrees

Trees · Easy problem

A sensor grid has 1010 nodes and the links 12,23,13,45,56,67,78,89,9-1012, 23, 13, 45, 56, 67, 78, 89, 9\text{-}10 — exactly 9=10−19 = 10 - 1 links, the count a spanning tree would need. What is the fewest additional links needed so that every node can reach every other node?

Practice more like this Review this concept