Spectral radius and signless Laplacian spectral radius of strongly connected digraphs

DOI10.1016/J.LAA.2014.05.007MaRDI QIDQ2250761zbMATH OpenOpenAlexFDO

Authors Wenxi Hong, Lihua You

Publication date 21 July 2014

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.7091

zbMATH Keywords

clique numberdigraphgirthsignless Laplacianspectral radiusvertex connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: Let D be a strongly connected digraph and A(D) be the adjacency matrix of D. Let diag(D) be the diagonal matrix with outdegrees of the vertices of D and Q(D) = diag(D) + A(D) be the signless Laplacian matrix of D. The spectral radius of Q(D) is called the signless Laplacian spectral radius of D, denoted by q(D). In this paper, we give sharp bound on q(D) with outdegree sequence and compare the bound with some known bounds, establish some sharp upper or lower bound on q(D) with some given parameter such as clique number, girth or vertex connectivity, and characterize the corresponding extremal digraph or proposed open problem. In addition, we also determine the unique digraph which achieves the minimum (or maximum), the second minimum (or maximum), the third minimum, the fourth minimum spectral radius and signless Laplacian spectral radius among all strongly connected digraphs, and answer the open problem proposed by Lin-Shu [H.Q. Lin, J.L. Shu, A note on the spectral characterization of strongly connected bicyclic digraphs, Linear Algebra Appl. 436 (2012) 2524{2530].

Recommendations

• The signless Laplacian spectral radius of some strongly connected digraphs
• Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs
• The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
• The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
• Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs

Cites work

• A note on the spectral characterization of strongly connected bicyclic digraphs
• Bounds and conjectures for the signless Laplacian index of graphs
• Distance spectral radius of digraphs with given connectivity
• Extremal digraphs with given clique number
• Graph theory with applications
• scientific article; zbMATH DE number 3760340 (Why is no real title available?)
• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 6260070 (Why is no real title available?)
• On a conjecture for the signless Laplacian eigenvalues
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Sharp bounds on the spectral radius of a nonnegative matrix
• Spectra of digraphs
• Spectral radius and degree sequence of a graph
• Spectral radius of digraphs with given dichromatic number
• Spectral radius of strongly connected digraphs
• The distance spectral radius of digraphs
• The maximum Perron roots of digraphs with some given parameters
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Towards a spectral theory of graphs based on the signless Laplacian. II.

Cited in

(24)

• The signless Laplacian spectral radius of \(k\)-connected irregular graphs
• The signless Laplacian spectral radius of some strongly connected digraphs
• An extending result on spectral radius of bipartite graphs
• On the spectrum of an equitable quotient matrix and its application
• A sharp upper bound on the spectral radius of a nonnegative \(k\)-uniform tensor and its applications to (directed) hypergraphs
• The \(A_\alpha\) spectral radius and maximum outdegree of irregular digraphs
• The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
• The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
• On spectral radius of strongly connected digraphs
• On the spectral radius of the generalized adjacency matrix of a digraph
• The signless Laplacian spectral characterization of strongly connected bicyclic digraphs
• Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs
• Some upper bounds for the signless Laplacian spectral radius of digraphs
• Colorings and spectral radius of digraphs
• On the generalized adjacency spectral radius of digraphs
• On the A_ spectral radius of digraphs with given parameters
• scientific article; zbMATH DE number 6260070 (Why is no real title available?)
• On the A_ɑ spectral radius of strongly connected digraphs
• Some α -spectral extremal results for some digraphs
• scientific article; zbMATH DE number 7735895 (Why is no real title available?)
• Bounds on the spectral radius of a nonnegative matrix and its applications
• Bicyclic digraphs with maximal energy
• Essential connectivity and spectral radius of graphs
• On the signless Laplacian energy of a digraph

This page was built for publication: Spectral radius and signless Laplacian spectral radius of strongly connected digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250761)