[5-Marks question]
Consider a graph whose vertices are points in the plane with integer co-ordinates (x,y) such that 1≤x≤n and 1≤y≤n, where n≥2 is an integer. Two vertices (x1,y1) and (x2,y2) are adjacent if ∣ x1−x2 ∣ ≤ 1 and ∣ y1–y2 ∣ ≤1. The weight of an edge {(x1,y1),(x2,y2)} is √(x1–x2)2+(y1–y2)2
a. What is the weight of a minimum weight-spanning tree in this graph? Write only the answer without any explanations.
b. What is the weight of a maximum weight-spanning tree in this graph? Write only the answer without any explanations.
Answer:
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post