Extremal Laplacian energy of $\overrightarrow{C_{k+1}}$-free digraphs

Abstract

The Laplacian energy of a digraph $G$ is defined as ${\sum }_{i=1}^n{\lambda }_i^2$, where ${\lambda }_i$ are the eigenvalues of the Laplacian matrix of $G$. A (di)graph $G$ is said to be $H$-free if it does not contain a copy of the fixed (di)graph $H$ as a sub(di)graph. In this paper, we extend the Turán problems to spectral Turán problems in digraphs: what is the maximal Laplacian energy of an $H$-free digraph of given order? In particular, we determine the maximum Laplacian energy and characterize the extremal digraphs of $\overrightarrow{C_{k+1}}$-free digraphs.