相关论文: New Bounds for the Laplacian Spectral Radius of a …
Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are…
In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized. In addition,…
In this paper, we determine the maximal Laplacian and signless Laplacian spectral radii for graphs with fixed number of vertices and domination number, and characterize the extremal graphs respectively.
We give upper and lower bounds for the spectral radius of a nonnegative matrix by using its average 2-row sums, and characterize the equality cases if the matrix is irreducible. We also apply these bounds to various nonnegative matrices…
In this paper, we obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral…
M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…
In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…
Let $G$ be a simple graph. The signless Laplacian spread of $G$ is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both lower and upper, for the signless Laplacian…
We give sharp upper bounds for the ordinary spectral radius and signless Laplacian spectral radius of a uniform hypergraph in terms of the average $2$-degrees or degrees of vertices, respectively, and we also give a lower bound for the…
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result…
In this paper, we present several upper bounds for the adjacency and signless Laplacian spectral radii of uniform hypergraphs in terms of degree sequences.
We characterize when the spectral variation of the signed Laplacian matrices is integral after a new edge is added to a signed graph. As an application, for every fixed signed complete graph, we fully characterize the class of signed graphs…
A signed graph is a graph whose edges are labeled either positive or negative. Corresponding to the two signed distance matrices defined for signed graphs, we define two signed distance laplacian matrices. We characterize balance in signed…
The spectral radius (or the signless Laplacian spectral radius) of a general hypergraph is the maximum modulus of the eigenvalues of its adjacency (or its signless Laplacian) tensor. In this paper, we firstly obtain a lower bound of the…
A signed graph is a graph in which every edge carries a $+$ or a $-$ sign. In this paper, we determine the signed graphs with maximum spectral radius among all unbalanced signed graphs with fixed order that contain neither negative…
Let $F_{a_1,\dots,a_k}$ be a graph consisting of $k$ cycles of odd length $2a_1+1,\dots, 2a_k+1$, respectively which intersect in exactly a common vertex, where $k\geq1$ and $a_1\ge a_2\ge \cdots\ge a_k\ge 1$. In this paper, we present a…
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…
In this paper, we present some spectral sufficient conditions for a graph to be Hamilton-connected in terms of the spectral radius or signless Laplacian spectral radius of the graph. Our results improve some previous work.
In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…
We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.