Abstract
Let G be a digraph with n vertices, a arcs, c2 directed closed walks of length 2. Let q1; q2;:::; qn be the eigenvalues of the signless Laplacian matrix of G. The signless Laplacian energy of a digraph G is defined as ESL(G) = ∑i=1n|qi−an|. In this paper, some lower and upper bounds are derived for the signless Laplacian energy of digraphs.
| Original language | English |
|---|---|
| Pages (from-to) | 411-421 |
| Number of pages | 11 |
| Journal | Indian Journal of Pure and Applied Mathematics |
| Volume | 48 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Sep 2017 |
Keywords
- digraph
- Energy
- signless Laplacian energy
Fingerprint
Dive into the research topics of 'Bounds for the signless Laplacian energy of digraphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver