The graph was designed how many would it take to partition the nodes into two disconnected sets with one set containing about the same number of nodes.....

The graph (other sheet) was designed to withstand a nuclear war. How many bombs would it take to partition the nodes into two disconnected sets with one set containing about the same number of nodes (within +/- two nodes) as the other set with the maximum number of nodes remaining? Assume that any bomb wipes out a node and all of the links connected to it. 12 13 1H 15 I8 19 2 25 26 28 The graph (other sheet) was designed to withstand a nuclear war. How many bombs would it take to partition the nodes into two disconnected sets with one set containing about the same number of nodes (within +/- two nodes) as the other set with the maximum number of nodes remaining? Assume that any bomb wipes out a node and all of the links connected to it. 12 13 1H 15 I8 19 2 25 26 28