AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize the unique graph whose least eigenvalue of the signless Laplacian attains the minimum among all graphs in Tnc⧹{K1,n-1c}, where K1,n-1c is the complement of the star graph on n vertices
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Abstract. It is shown that among all trees with a fixed number of vertices the path has the smallest...
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are ...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian ...
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices ...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
Abstract. For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signle...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
AbstractWe investigate how the least eigenvalue of the signless Laplacian of a graph changes by relo...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Abstract. It is shown that among all trees with a fixed number of vertices the path has the smallest...
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are ...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian ...
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices ...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
Abstract. For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signle...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
AbstractWe investigate how the least eigenvalue of the signless Laplacian of a graph changes by relo...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
Abstract. It is shown that among all trees with a fixed number of vertices the path has the smallest...
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are ...
DOI
Add to ORKG