AbstractWe study the spectral radius of connected non-regular graphs. Let λ1(n,Δ) be the maximum spectral radius among all connected non-regular graphs with n vertices and maximum degree Δ. We prove that Δ−λ1(n,Δ)=Θ(Δ/n2). This improves two recent results by Stevanović and Zhang, respectively
AbstractWe consider the set Gn,k of graphs of order n with the chromatic number k≥2. In this note, w...
AbstractWe present a new type of lower bound for the spectral radius of a graph in which m nodes are...
AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every conn...
AbstractIn this paper, we investigate the ratio of any two components of a maximal eigenvector of a ...
AbstractLet λ1 be the greatest eigenvalue and λn the least eigenvalue of the adjacency matrix of a c...
AbstractLet λ1 be the largest eigenvalue and λn the least eigenvalue of the adjacency matrix of a co...
Let G = (V, E) be a simple connected graph with V (G) = {v1, v2, …, vn} and degree sequence d1, d2, ...
AbstractLet G be a simple connected graph with V(G)={v1,v2,…,vn} and girth at least 5. Let Δ be the ...
summary:Let $G$ be a graph with $n$ vertices, $m$ edges and a vertex degree sequence $(d_1, d_2, ...
AbstractWe find lower bounds on the difference between the spectral radius λ1 and the average degree...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
AbstractLet M=(mij) be a nonnegative irreducible n×n matrix with diagonal entries 0. The largest eig...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractWe consider the set Gn,k of graphs of order n with the chromatic number k≥2. In this note, w...
AbstractWe present a new type of lower bound for the spectral radius of a graph in which m nodes are...
AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every conn...
AbstractIn this paper, we investigate the ratio of any two components of a maximal eigenvector of a ...
AbstractLet λ1 be the greatest eigenvalue and λn the least eigenvalue of the adjacency matrix of a c...
AbstractLet λ1 be the largest eigenvalue and λn the least eigenvalue of the adjacency matrix of a co...
Let G = (V, E) be a simple connected graph with V (G) = {v1, v2, …, vn} and degree sequence d1, d2, ...
AbstractLet G be a simple connected graph with V(G)={v1,v2,…,vn} and girth at least 5. Let Δ be the ...
summary:Let $G$ be a graph with $n$ vertices, $m$ edges and a vertex degree sequence $(d_1, d_2, ...
AbstractWe find lower bounds on the difference between the spectral radius λ1 and the average degree...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
AbstractLet M=(mij) be a nonnegative irreducible n×n matrix with diagonal entries 0. The largest eig...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractWe consider the set Gn,k of graphs of order n with the chromatic number k≥2. In this note, w...
AbstractWe present a new type of lower bound for the spectral radius of a graph in which m nodes are...
AbstractAnswering some questions of Gutman, we show that, except for four specific trees, every conn...
DOI
Add to ORKG