AbstractWe investigate how the least eigenvalue of the signless Laplacian of a graph changes by relocating a bipartite branch from one vertex to another vertex, and minimize the least eigenvalue of the signless Laplacian among the class of connected graphs with fixed order which contains a given non-bipartite graph as an induced subgraph
Abstract. A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalu...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
Abstract. For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signle...
AbstractWe investigate how the least eigenvalue of the signless Laplacian of a graph changes by relo...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
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 ...
Abstract. Let H be a connected bipartite graph, whose signless Laplacian matrix is Q(H). Suppose tha...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
Abstract. A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalu...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
Abstract. For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signle...
AbstractWe investigate how the least eigenvalue of the signless Laplacian of a graph changes by relo...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
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 ...
Abstract. Let H be a connected bipartite graph, whose signless Laplacian matrix is Q(H). Suppose tha...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
Abstract. A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalu...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
DOI
Add to ORKG