AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractLet G be a simple graph. In this paper, we obtain a sequence (bp)p=1∞ of upper bounds on the...
AbstractIn this paper, we first obtain a sharp upper bound for the eigenvalues of the adjacency matr...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
AbstractWe consider weighted graphs, such as graphs where the edge weights are positive definite mat...
We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of...
WOS: 000304736800006We consider weighted graphs, such as graphs where the edge weights are positive ...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. The Lapl...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a grap...
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractLet G be a simple graph. In this paper, we obtain a sequence (bp)p=1∞ of upper bounds on the...
AbstractIn this paper, we first obtain a sharp upper bound for the eigenvalues of the adjacency matr...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
AbstractWe consider weighted graphs, such as graphs where the edge weights are positive definite mat...
We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of...
WOS: 000304736800006We consider weighted graphs, such as graphs where the edge weights are positive ...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. The Lapl...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a grap...
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractLet G be a simple graph. In this paper, we obtain a sequence (bp)p=1∞ of upper bounds on the...
DOI
Add to ORKG