Integral saturation of adjacency-degree latticesResearch Paper
Start from the constant function on the vertices of a graph and apply two operations: summing over neighbours (multiplication by the adjacency matrix ) and multiplying by the vertex degree (the diagonal matrix ). Over a field, the vectors obtained span a cyclic module, and asking whether it is the whole space is a…