Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient c...Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient conditions on V such that ifΩis convex,the solution u is log-concave.We also determine sufficient conditions ensuring that λ_(V),as a function of the setΩ,verifies a convexity inequality with respect to the Minkowski addition of sets.展开更多
In this paper,we investigate the weighted Dirichlet eigenvalue problem of polynomial operator of the drifting Laplacian on the cigar soliton■as follows■where is a positive continuous function on,denotes the outward ...In this paper,we investigate the weighted Dirichlet eigenvalue problem of polynomial operator of the drifting Laplacian on the cigar soliton■as follows■where is a positive continuous function on,denotes the outward unit normal to the boundary,and are two nonnegative constants.We establish some universal inequalities for eigenvalues of this problem.展开更多
This paper is devoted to the Polynomial Preserving Recovery (PPR) based a posteriori error analysis for the second-order elliptic non-symmetric eigenvalue problem. An asymptotically exact a posteriori error estimator ...This paper is devoted to the Polynomial Preserving Recovery (PPR) based a posteriori error analysis for the second-order elliptic non-symmetric eigenvalue problem. An asymptotically exact a posteriori error estimator is proposed for solving the convection-dominated non-symmetric eigenvalue problem with non-smooth eigenfunctions or multiple eigenvalues. Numerical examples confirm our theoretical analysis.展开更多
Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the A_(α)-matrix of G as A_(α)(G)=αD(G)+(1-α)A(G),where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,re...Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the A_(α)-matrix of G as A_(α)(G)=αD(G)+(1-α)A(G),where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,respectively.In this paper,we investigate how the least eigenvalue of A_(α)(G)changes when the graph G is perturbed by deleting a vertex,subdividing edges or moving edges,respectively.展开更多
This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solve...This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.展开更多
We consider the interior transmission eigenvalue problem corresponding to the scattering for an anisotropic medium of the scalar Helmholtz equation in the case where the boundary?Ωis split into two disjoint parts and...We consider the interior transmission eigenvalue problem corresponding to the scattering for an anisotropic medium of the scalar Helmholtz equation in the case where the boundary?Ωis split into two disjoint parts and possesses different transmission conditions.Using the variational method,we obtain the well posedness of the interior transmission problem,which plays an important role in the proof of the discreteness of eigenvalues.Then we achieve the existence of an infinite discrete set of transmission eigenvalues provided that n≡1,where a fourth order differential operator is applied.In the case of n■1,we show the discreteness of the transmission eigenvalues under restrictive assumptions by the analytic Fredholm theory and the T-coercive method.展开更多
A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential ...A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential function for the Zakharov–Shabat eigenvalue problem. The mapping can distribute Chebyshev nodes very well considering the gradient for the potential function. Using Chebyshev polynomials, tanh(ax) mapping, and Chebyshev nodes, the Zakharov–Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. This method has good convergence for the Satsuma–Yajima potential and the convergence rate is faster than the Fourier collocation method. This method is not only suitable for simple potential functions but also converges quickly for a complex Y-shape potential. It can also be further extended to other linear eigenvalue problems.展开更多
Wave propagation in horizontally layered media is a classical problem in seismic-wave theory.In semi-infinite space,a nondispersive Rayleigh wave mode exists,and the eigendisplacement decays exponentially with depth.I...Wave propagation in horizontally layered media is a classical problem in seismic-wave theory.In semi-infinite space,a nondispersive Rayleigh wave mode exists,and the eigendisplacement decays exponentially with depth.In a layered model with increasing layer velocity,the phase velocity of the Rayleigh wave varies between the S-wave velocity of the bottom half-space and that of the classical Rayleigh wave propagated in a supposed half-space formed by the parameters of the top layer.If the phase velocity is the same as the P-or S-wave velocity of the layer,which is called the critical mode or critical phase velocity of surface waves,the general solution of the wave equation is not a homogeneous(expressed by trigonometric functions)or inhomogeneous(expressed by exponential functions)plane wave,but one whose amplitude changes linearly with depth(expressed by a linear function).Theories based on a general solution containing only trigonometric or exponential functions do not apply to the critical mode,owing to the singularity at the critical phase velocity.In this study,based on the classical framework of generalized reflection and transmission coefficients,the propagation of surface waves in horizontally layered media was studied by introducing a solution for the linear function at the critical phase velocity.Therefore,the eigenvalues and eigenfunctions of the critical mode can be calculated by solving a singular problem.The eigendisplacement characteristics associated with the critical phase velocity were investigated for different layered models.In contrast to the normal mode,the eigendisplacement associated with the critical phase velocity exhibits different characteristics.If the phase velocity is equal to the S-wave velocity in the bottom half-space,the eigendisplacement remains constant with increasing depth.展开更多
Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the syste...Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the system is not Hermitian,the eigenvalues can still be purely real under specific symmetry.Hence,great enthusiasm has been devoted to exploring the eigenvalue problem of non-Hermitian systems.In this work,from a distinct perspective,we demonstrate that real eigenvalues can also emerge under the appropriate recursive condition of eigenstates.Consequently,our findings provide another path to extract the real energy spectrum of non-Hermitian systems,which guarantees the conservation of probability and stimulates future experimental observations.展开更多
In this paper,we consider the eigenvalue problem of the singular differential equation-Δu_(i)-h/|x|^(2) u_(i)+V(x)u_(i)=λ_(i)(V,h)u_(i) in a bounded open ball with Dirichlet boundary condition in 3-dimensional space...In this paper,we consider the eigenvalue problem of the singular differential equation-Δu_(i)-h/|x|^(2) u_(i)+V(x)u_(i)=λ_(i)(V,h)u_(i) in a bounded open ball with Dirichlet boundary condition in 3-dimensional space,where,V∈V={a∈L^(∞)(Ω)|0≤a≤M a.e.,M is a given constant}.And we have made a detailed characterization of the weak solution space.Furthermore,the existence of the minimum eigenvalue and the fundamental gap are provided.展开更多
A graph G is said to be planar if G can be drawn on the plane in such a way that its edges intersect only at their endpoints.In this paper,all the planar graphs without isolated vertices whose second largest eigenvalu...A graph G is said to be planar if G can be drawn on the plane in such a way that its edges intersect only at their endpoints.In this paper,all the planar graphs without isolated vertices whose second largest eigenvalue smaller than(√5-1)/2 are characterized.展开更多
We propose a simple embedding method for computing the eigenvalues and eigenfunctions of the Laplace-Beltrami operator on implicit surfaces.The approach follows an embedding approach for solving the surface eikonal eq...We propose a simple embedding method for computing the eigenvalues and eigenfunctions of the Laplace-Beltrami operator on implicit surfaces.The approach follows an embedding approach for solving the surface eikonal equation.We replace the differential operator on the interface with a typical Cartesian differential operator in the surface neighborhood.Our proposed algorithm is easy to implement and efficient.We will give some two-and three-dimensional numerical examples to demonstrate the effectiveness of our proposed approach.展开更多
Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I ...Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I in terms of various structuralparameters of the graph G,including vertex-connectivity,independence number and pendant vertices.展开更多
A procedure is presented for computing the derivatives of repeated eigenvalues and the corresponding eigenvectors of damped systems. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the s...A procedure is presented for computing the derivatives of repeated eigenvalues and the corresponding eigenvectors of damped systems. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the second-order system, and the use of rather undesirable state space representation is avoided. Hence the cost of computation is greatly reduced. The efficiency of the proposed procedure is illustrated by considering a 5-DOF non-proportionally damped system.展开更多
A new method for estimating the bounds of eigenvalues ispresented. In order to show that the method proposed is as effectiveas Qiu's an undamping spring-mass system with 5 nodes and 5 degrees ofreedom is given. To...A new method for estimating the bounds of eigenvalues ispresented. In order to show that the method proposed is as effectiveas Qiu's an undamping spring-mass system with 5 nodes and 5 degrees ofreedom is given. To illustrate that the present method can beapplied to structures which cannot be treated by non-negativedecomposition, a plane frame with 202 nodes and 357 beam elements isgiven. The results show that the present method is effective forestimating the bounds of eigenvalues and is more common than Qiu's.展开更多
The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur d...The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.展开更多
In present paper, using some methods of approximation theory, the trace formulas for eigenvalues of a eigenvalue problem are calculated under the periodic condition and the decaying condition at x∞.
A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian ei...A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.展开更多
基金supported by the project Disuguaglianze analitiche e geometriche,funded by the Gruppo per Analisi Matematica la Probabilitàe le loro Applicazioni.
文摘Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient conditions on V such that ifΩis convex,the solution u is log-concave.We also determine sufficient conditions ensuring that λ_(V),as a function of the setΩ,verifies a convexity inequality with respect to the Minkowski addition of sets.
基金Supported by National Natural Science Foundation of China(11001130,12272062)Fundamental Research Funds for the Central Universities(30917011335).
文摘In this paper,we investigate the weighted Dirichlet eigenvalue problem of polynomial operator of the drifting Laplacian on the cigar soliton■as follows■where is a positive continuous function on,denotes the outward unit normal to the boundary,and are two nonnegative constants.We establish some universal inequalities for eigenvalues of this problem.
基金Supported by the National Natural Science Foundation of China (Grant Nos.1236108412001130)。
文摘This paper is devoted to the Polynomial Preserving Recovery (PPR) based a posteriori error analysis for the second-order elliptic non-symmetric eigenvalue problem. An asymptotically exact a posteriori error estimator is proposed for solving the convection-dominated non-symmetric eigenvalue problem with non-smooth eigenfunctions or multiple eigenvalues. Numerical examples confirm our theoretical analysis.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1207141112171222)the Basic Research Program(Natural Science)of Yancheng(Grant No.YCBK2024043)。
文摘Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the A_(α)-matrix of G as A_(α)(G)=αD(G)+(1-α)A(G),where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,respectively.In this paper,we investigate how the least eigenvalue of A_(α)(G)changes when the graph G is perturbed by deleting a vertex,subdividing edges or moving edges,respectively.
基金the National Science and Tech-nology Council,Taiwan for their financial support(Grant Number NSTC 111-2221-E-019-048).
文摘This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.
基金supported by the National Natural Science Foundation of China(11571132,12301542)the Natural Science Foundation of Hubei(2022CFB725)the Natural Science Foundation of Yichang(A23-2-027)。
文摘We consider the interior transmission eigenvalue problem corresponding to the scattering for an anisotropic medium of the scalar Helmholtz equation in the case where the boundary?Ωis split into two disjoint parts and possesses different transmission conditions.Using the variational method,we obtain the well posedness of the interior transmission problem,which plays an important role in the proof of the discreteness of eigenvalues.Then we achieve the existence of an infinite discrete set of transmission eigenvalues provided that n≡1,where a fourth order differential operator is applied.In the case of n■1,we show the discreteness of the transmission eigenvalues under restrictive assumptions by the analytic Fredholm theory and the T-coercive method.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.52171251,U2106225,and 52231011)Dalian Science and Technology Innovation Fund (Grant No.2022JJ12GX036)。
文摘A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential function for the Zakharov–Shabat eigenvalue problem. The mapping can distribute Chebyshev nodes very well considering the gradient for the potential function. Using Chebyshev polynomials, tanh(ax) mapping, and Chebyshev nodes, the Zakharov–Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. This method has good convergence for the Satsuma–Yajima potential and the convergence rate is faster than the Fourier collocation method. This method is not only suitable for simple potential functions but also converges quickly for a complex Y-shape potential. It can also be further extended to other linear eigenvalue problems.
基金supported by the National Natural Science Foundation of China(No.U1839209).
文摘Wave propagation in horizontally layered media is a classical problem in seismic-wave theory.In semi-infinite space,a nondispersive Rayleigh wave mode exists,and the eigendisplacement decays exponentially with depth.In a layered model with increasing layer velocity,the phase velocity of the Rayleigh wave varies between the S-wave velocity of the bottom half-space and that of the classical Rayleigh wave propagated in a supposed half-space formed by the parameters of the top layer.If the phase velocity is the same as the P-or S-wave velocity of the layer,which is called the critical mode or critical phase velocity of surface waves,the general solution of the wave equation is not a homogeneous(expressed by trigonometric functions)or inhomogeneous(expressed by exponential functions)plane wave,but one whose amplitude changes linearly with depth(expressed by a linear function).Theories based on a general solution containing only trigonometric or exponential functions do not apply to the critical mode,owing to the singularity at the critical phase velocity.In this study,based on the classical framework of generalized reflection and transmission coefficients,the propagation of surface waves in horizontally layered media was studied by introducing a solution for the linear function at the critical phase velocity.Therefore,the eigenvalues and eigenfunctions of the critical mode can be calculated by solving a singular problem.The eigendisplacement characteristics associated with the critical phase velocity were investigated for different layered models.In contrast to the normal mode,the eigendisplacement associated with the critical phase velocity exhibits different characteristics.If the phase velocity is equal to the S-wave velocity in the bottom half-space,the eigendisplacement remains constant with increasing depth.
基金This work was supported by the National Natural Science Foundation of China(Grant No.62071248)the Natural Science Foundation of Nanjing University of Posts and Telecommunications(Grant No.NY223109)China Postdoctoral Science Foundation(Grant No.2022M721693).
文摘Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the system is not Hermitian,the eigenvalues can still be purely real under specific symmetry.Hence,great enthusiasm has been devoted to exploring the eigenvalue problem of non-Hermitian systems.In this work,from a distinct perspective,we demonstrate that real eigenvalues can also emerge under the appropriate recursive condition of eigenstates.Consequently,our findings provide another path to extract the real energy spectrum of non-Hermitian systems,which guarantees the conservation of probability and stimulates future experimental observations.
文摘In this paper,we consider the eigenvalue problem of the singular differential equation-Δu_(i)-h/|x|^(2) u_(i)+V(x)u_(i)=λ_(i)(V,h)u_(i) in a bounded open ball with Dirichlet boundary condition in 3-dimensional space,where,V∈V={a∈L^(∞)(Ω)|0≤a≤M a.e.,M is a given constant}.And we have made a detailed characterization of the weak solution space.Furthermore,the existence of the minimum eigenvalue and the fundamental gap are provided.
基金Supported by the National Natural Science Foundation of China(Grant No.12171154)。
文摘A graph G is said to be planar if G can be drawn on the plane in such a way that its edges intersect only at their endpoints.In this paper,all the planar graphs without isolated vertices whose second largest eigenvalue smaller than(√5-1)/2 are characterized.
基金supported in part by the Hong Kong RGC 16302223.
文摘We propose a simple embedding method for computing the eigenvalues and eigenfunctions of the Laplace-Beltrami operator on implicit surfaces.The approach follows an embedding approach for solving the surface eikonal equation.We replace the differential operator on the interface with a typical Cartesian differential operator in the surface neighborhood.Our proposed algorithm is easy to implement and efficient.We will give some two-and three-dimensional numerical examples to demonstrate the effectiveness of our proposed approach.
基金supported by the Natural Science Foundation of Xinjiang Uygur Autonomous Region of China“Graph problems of topological parameters based on the spectra of graph matrices”(2021D01C069)the National Natural Science Foundation of the People's Republic of China“The investigation of spectral properties of graph operations and their related problems”(12161085)。
文摘Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I in terms of various structuralparameters of the graph G,including vertex-connectivity,independence number and pendant vertices.
基金Supported by the National Basic Research Program(973 Program)of China(2013CB329402)the National Natural Science Foundation of China(61473215,61472306,61271302,61272282,61272176)
基金Project supported by the Mathematical Tianyuan Foundation of China (No. 10626019)
文摘A procedure is presented for computing the derivatives of repeated eigenvalues and the corresponding eigenvectors of damped systems. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the second-order system, and the use of rather undesirable state space representation is avoided. Hence the cost of computation is greatly reduced. The efficiency of the proposed procedure is illustrated by considering a 5-DOF non-proportionally damped system.
基金the National Natural Science Foundation (No.19872028)the Mechanical Technology Development Foundation of China
文摘A new method for estimating the bounds of eigenvalues ispresented. In order to show that the method proposed is as effectiveas Qiu's an undamping spring-mass system with 5 nodes and 5 degrees ofreedom is given. To illustrate that the present method can beapplied to structures which cannot be treated by non-negativedecomposition, a plane frame with 202 nodes and 357 beam elements isgiven. The results show that the present method is effective forestimating the bounds of eigenvalues and is more common than Qiu's.
基金The National Natural Science Foundation of China(No.60572072,60496311),the National High Technology Researchand Development Program of China (863Program ) ( No.2003AA123310),the International Cooperation Project on Beyond 3G Mobile of China (No.2005DFA10360).
文摘The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.
文摘In present paper, using some methods of approximation theory, the trace formulas for eigenvalues of a eigenvalue problem are calculated under the periodic condition and the decaying condition at x∞.
基金Supported by the National Natural Science Foundation of China(Grant No.11771443)the Fundamental Research Funds for the Central Universities(Grant No.2018BSCXB24)the Postgraduate Research&Practice Innovation Program of Jiangsu Province(Grant No.KYCX18JL980).
文摘A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.
