Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm

DOI10.1142/S0129054115500203zbMath1321.05154OpenAlexW2249660655MaRDI QIDQ2947960

Cun-Quan Zhang, Guodong Guo, Rong Luo, Xingqin Qi, Edgar Fuller

Publication date: 29 September 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054115500203

zbMATH Keywords

eigenvaluedigraphLaplacian matrixLaplacian energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number ⋮ The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number ⋮ On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs ⋮ Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs

Cites Work

• Applications of a theorem by Ky Fan in the theory of graph energy
• GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
• On the Laplacian energy of a graph

This page was built for publication: Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm