One nice identity is $$tr(A^3)/6$$ which counts the number of triangles of a graph represented with adjacency matrix $A.$ It also implies that triangle counting can be performed in subcubic time. ...
Sorry if the following are stupid questions (i do not know much about the graph theory). 1. Motivation we do not know the graph isomorphism problem in class P or NP complete and it is P in the ...