  We present two hypermatrix formulations of the Cayley Hamilton theorem. One
of the proposed formulation naturally extends to hypermatrices the
combinatorial interpretations of the classical Cayley Hamilton theorem. We
conclude by discussing an application of the theorem to computing graph
invariants which distinguish some non-isomorphic graphs with isospectral
adjacency matrices.
