Abstract
Let G→ be a strongly connected digraph and Q(G→) be the signless Laplacian matrix of G→. The spectral radius of Q(G→) is called the signless Lapliacian spectral radius of G→. Let ∞˜ 1-digraph and ∞˜ 2-digraph be two kinds of generalized strongly connected 1-digraphs and let θ˜ 1-digraph and θ˜ 2-digraph be two kinds of generalized strongly connected µ-digraphs. In this paper, we determine the unique digraph which attains the maximum(or minimum) signless Laplacian spectral radius among all ∞˜ 1-digraphs and θ˜ 1-digraphs. Furthermore, we characterize the extremal digraph which achieves the maximum signless Laplacian spectral radius among ∞˜ 2-digraphs and θ˜ 2-digraphs, respectively.
| Original language | English |
|---|---|
| Pages (from-to) | 113-127 |
| Number of pages | 15 |
| Journal | Indian Journal of Pure and Applied Mathematics |
| Volume | 49 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Mar 2018 |
Keywords
- The signless Laplacian spectral radius
- θ˜ -digraph
- θ˜ -digraph
- ∞˜ -digraph
- ∞˜ -digraph
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver