AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality holds and then apply the inequality to give an upper bound for the largest Laplacian eigenvalue λ1(G) of a graph. In addition, we give two other types of upper bound for λ1(G) and determine the extremal graphs which achieve the bounds
In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and t...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a simple connected weighted graph on n vertices in which the edge weights are posit...
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
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...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. The Lapl...
WOS: 000304736800006We consider weighted graphs, such as graphs where the edge weights are positive ...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and t...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a simple connected weighted graph on n vertices in which the edge weights are posit...
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
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...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of...
AbstractWe consider weighted graphs, where the edge weights are positive definite matrices. The Lapl...
WOS: 000304736800006We consider weighted graphs, such as graphs where the edge weights are positive ...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and t...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a simple connected weighted graph on n vertices in which the edge weights are posit...
DOI
Add to ORKG