Extremizing first eigenvalue of 3-colored digraphs made with given blocks

This article describes the structure of the non-singular connected 3-colored digraphs extremizing the first eigenvalue among all such graphs made with some given blocks. As an application we determine the non-singular unicyclic 3-colored digraph, which minimizes the first eigenvalue over all such graphs with fixed order and girth.