AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian eigenvalue. We present some bounds on the largest eigenvalue, which generalize those given in the linear case. Some examples of applications are given. Then, we compare our bounds to the classical bounds in the particular case of the trees
AbstractWe consider weighted graphs, such as graphs where the edge weights are positive definite mat...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
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...
AbstractFor a real number p with 1<p we consider the first eigenvalues of the p-Laplacian on graphs,...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence...
We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractSeveral applications of Laplace eigenvalues of graphs in graph theory and combinatorial opti...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In p...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractWe consider weighted graphs, such as graphs where the edge weights are positive definite mat...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
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...
AbstractFor a real number p with 1<p we consider the first eigenvalues of the p-Laplacian on graphs,...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence...
We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractSeveral applications of Laplace eigenvalues of graphs in graph theory and combinatorial opti...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In p...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractWe consider weighted graphs, such as graphs where the edge weights are positive definite mat...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
DOI
Add to ORKG