Newman degree assortativity as an exact rational (0 for regular graphs)
GraphAssortativity[g]
GraphAssortativity[g, "prop"]
GraphAssortativity[g, {{vi 1, vi 2, …}, …}]
GraphAssortativity[g, {v1, v2, …} -> {x1, x2, …}]
GraphAssortativity[{v -> w, …}, …]
Labeled[#, GraphAssortativity[#, "VertexColor"]]& /@ graphs
→ graphs