Add to ORKGLet G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ dn. The spectral radius ρ(G) of graph G is the largest eigenvalue of its adjacency matrix. In this paper, we present some sharp upper bounds of the spectral radius in terms of the degree sequence of graphs. AMS classification: 05C50 Key words: Spectral radius; Upper bound; Largest degree; Similar matrices. 1
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. W...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
summary:Let $G$ be a simple connected graph of order $n$ with degree sequence $(d_1,d_2,\ldots ,d_...
AbstractLet G be a simple connected graph with n vertices and m edges. Let A be the adjacency matrix...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. W...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
summary:Let $G$ be a simple connected graph of order $n$ with degree sequence $(d_1,d_2,\ldots ,d_...
AbstractLet G be a simple connected graph with n vertices and m edges. Let A be the adjacency matrix...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. W...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...