DOIAbstract
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper and lower bounds on the greatest eigenvalue and a lower bound on the smallest eigenvalue
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper and lower bounds on the greatest eigenvalue and a lower bound on the smallest eigenvalue
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a grap...
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius o...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
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 ...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. The eige...
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a grap...
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius o...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
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 ...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues ...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. The eige...
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a grap...
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius o...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
Add to ORKG