We classify those digraphs with a given number of vertices and a given clique number that maximize the Perron root of the adjacency matrix.