Answer to Question #8376 in Discrete Mathematics for Tina
Show that a connected graph of diameter k and minimum degree d has at least about kd/3 vertices but need not have substantially more.
0
Answer in progress...
Need a fast expert's response?
Submit order
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!
Comments
Leave a comment