Abstract
Let A(G) and D+(G) be the adjacency matrix of a digraph G with n vertices and the diagonal matrix of vertex outdegrees of G, respectively. Then the Laplacian matrix of the digraph G is L(G)=D+(G)−A(G). The Laplacian energy of a digraph G is defined as LE(G)=∑i=1nλi2 by using second spectral moment, where λ1,λ2,…,λn are all the eigenvalues of L(G) of G. In this paper, by using arc shifting operation and out-star shifting operation, we determine the directed trees, unicyclic digraphs and bicyclic digraphs which attain maximal and minimal Laplacian energy among all digraphs with n vertices, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
