The signless Laplacian spectral radius of some strongly connected digraphs
From MaRDI portal
Publication:1799428
DOI10.1007/s13226-018-0257-8zbMath1402.05089OpenAlexW2791834186WikidataQ130105020 ScholiaQ130105020MaRDI QIDQ1799428
Li-Gong Wang, Shangyuan Zhang, Xihe Li
Publication date: 18 October 2018
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-018-0257-8
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
On the A_ɑ spectral radius of strongly connected digraphs ⋮ On the Aα spectral radius of digraphs with given parameters ⋮ Some α -spectral extremal results for some digraphs ⋮ On the spectral radius of the generalized adjacency matrix of a digraph ⋮ The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
Cites Work
- Unnamed Item
- On the spectral characterization of pineapple graphs
- Laplacian spectral characterization of some graph join
- The spectral characterization of wind-wheel graphs
- Spectral characterizations of almost complete graphs
- Some results on the spectral radius of generalized \(\infty\) and \(\theta\)-digraphs
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- Spectral characterizations of the corona of a cycle and two isolated vertices
- Developments on spectral characterizations of graphs
- The lollipop graph is determined by its \(Q\)-spectrum
- Which graphs are determined by their spectrum?
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
- On the signless Laplacian spectral characterization of the line graphs of T-shape trees
- Laplacian spectral characterization of clover graphs
This page was built for publication: The signless Laplacian spectral radius of some strongly connected digraphs