Add to ORKGUsing Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Belardo’s interlacing theorem on the signless Laplacian eigenvalues of a graph in [6], we in this note obtain spectral conditions for some Hamiltonian properties of graph
AbstractWe give tight conditions on the signless Laplacian spectral radius of a graph for the existe...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractIn this paper, we focus on some operations of graphs and give a kind of eigenvalue interlaci...
In this paper, we investigate the relation between the Q-spectrum and the structure of G in terms of...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Lapl...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of lapl...
We consider the spectral and algorithmic aspects of the problem of finding a Hamiltonian cycle in a ...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
Abstract. A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractWe prove some results concerning necessary conditions for a graph to be Hamiltonian in terms...
AbstractIn this note we discuss interlacing inequalities relating the eigenvalues of a partitioned H...
Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple u...
AbstractWe give tight conditions on the signless Laplacian spectral radius of a graph for the existe...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractIn this paper, we focus on some operations of graphs and give a kind of eigenvalue interlaci...
In this paper, we investigate the relation between the Q-spectrum and the structure of G in terms of...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Lapl...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of lapl...
We consider the spectral and algorithmic aspects of the problem of finding a Hamiltonian cycle in a ...
In this note we discuss interlacing inequalities relating the eigenvalues of a partitioned Hermitian...
Abstract. A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractWe prove some results concerning necessary conditions for a graph to be Hamiltonian in terms...
AbstractIn this note we discuss interlacing inequalities relating the eigenvalues of a partitioned H...
Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple u...
AbstractWe give tight conditions on the signless Laplacian spectral radius of a graph for the existe...
AbstractIn this paper, we present lower and upper bounds for the independence number α(G) and the cl...
AbstractIn this paper, we focus on some operations of graphs and give a kind of eigenvalue interlaci...