AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a connected graph. We first characterize all simple connected graphs with second largest signless Laplacian eigenvalue at most 3. The second part of the present paper is devoted to the study of the graphs that maximize the second largest Q-eigenvalue. We construct families of such graphs and prove that some of theses families are minimal for the fact that they maximize the second largest signless Laplacian eigenvalue
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A,...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
Let Γ=(G,σ) be a signed graph, where G is the underlying graph and σ:E(G)→{+,-} is the signature fun...
Let G be a graph of order n, and let q1(G)≥⋯≥q n(G) be the eigenvalues of the Q-matrix of G, also kn...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A,...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
Let Γ=(G,σ) be a signed graph, where G is the underlying graph and σ:E(G)→{+,-} is the signature fun...
Let G be a graph of order n, and let q1(G)≥⋯≥q n(G) be the eigenvalues of the Q-matrix of G, also kn...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...