Add to ORKGAbstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bounds for eigenvalues are given, and the main result concerns the graphs whose largest eigenvalue is maximal among the graphs with fixed numbers of vertices and edges. The results are presented in the context of a number of computer-generated conjectures. 1
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are ...
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are ...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bo...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are ...
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are ...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...