 Four-cycle counting by common neighbours

For a simple graph, let $r_{ij}$ count the common neighbours of vertices $i,j$. Choosing two such neighbours makes a four-cycle, and each cycle is counted twice through its opposite pairs. The displayed identity follows even when extra edges are present, since cycles are counted as subgraphs rather than induced subgraphs. Also ${\sum }_{i<j}{r}_{ij}={\sum }_v\left(\genfrac{}{}{0ex}{}{d(v)}{2}\right)$. Applying Cauchy-Schwarz inequality to degrees and Jensen inequality to common-neighbour counts gives extremal edge and cycle bounds.