A graph-theoretic approach for comparing dimensions of components in simply-graded algebras

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal.