Looking for help with these two discrete math problems please and thank you!
Posted: Thu May 12, 2022 9:28 am
Looking for help with these two discrete math problems please
and thank you!
8. How many spanning trees does K3,3 have? 9. The roads represented by this graph are all unpaved. The lengths of the roads between pairs of towns are represented by edge weights. Which roads should be paved so that there is a path of paved roads between each pair of towns so that a minimum road length is paved? (Note: These towns are in Nevada.)
Manhattan 00 55 80 Tanopah Warm Springs 40 Dyer 20 Silver Pea Goldfield 25 Lida Oasis 70 12 10 30 Deep Springs Gold Point Beatty
and thank you!
- Looking For Help With These Two Discrete Math Problems Please And Thank You 1 (23.81 KiB) Viewed 23 times
Manhattan 00 55 80 Tanopah Warm Springs 40 Dyer 20 Silver Pea Goldfield 25 Lida Oasis 70 12 10 30 Deep Springs Gold Point Beatty