3. Consider a connected graph and assume that we want to minimize R = Σ wuv(Xu – rv) (U.EE 1 for positive weights Wwv, s
Posted: Sun Sep 05, 2021 5:01 pm
3. Consider a connected graph and assume that we want to minimize R = Σ wuv(Xu – rv) (U.EE 1 for positive weights Wwv, subject to the constraints Luer Xy = 0 and Sueva = 1. (a) How will you define the graph Laplacian to achieve this? (b) What is the minimum possible R and how can you find the values of xy achieving this minimum?