The vertex degree matrix LGC defines the cost function Q which integrates two penalty components, global smoothness and local fitting (µ is the regularization parameter): The first part of the cost function is the smoothness constraint: a good classifying function should not change too much between nearby points.
if x i and x j are connected with an edge, the difference between them should be small.