Normalized cut size for graph partitioning: Normalized cut size of a simple undirected graph partitioned in two groups g_1 and g_2 is defined as: R_n = 2mR/k_1k_2 where R is cut size, ?_1 and k_2 arc the sums of degrees of nodes in g_1 and g_2. and m is the number of links. In some applications minimizing the normalized cut size is preferred to minimizing the simple cut size because we do not. need to make an unnatural constraint on the group sizes anymore. Let us introduce the network division vector s as: if node i belongs to g_1 Squareroot k_1/k_2 if node i belongs to g_2 Show that the following holds: s^TLs = 2mR_n. Normalized cut size for graph partitioning: Normalized cut size of a simple undirected graph partitioned in two groups g_1 and g_2 is defined as: R_n = 2mR/k_1k_2 where R is cut size, ?_1 and k_2 arc the sums of degrees of nodes in g_1 and g_2. and m is the number of links. In some applications minimizing the normalized cut size is preferred to minimizing the simple cut size because we do not. need to make an unnatural constraint on the group sizes anymore. Let us introduce the network division vector s as: if node i belongs to g_1 Squareroot k_1/k_2 if node i belongs to g_2 Show that the following holds: s^TLs = 2mR_n