Extremal digraphs with given clique number
Engineering Village
-
摘要
We classify those digraphs with a given number of vertices and a given clique number that maximize the Perron root of the adjacency matrix.
关键词
Characteristic polynomials Clique number Digraph Perron roots Tournament
