DOIAbstract
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize the unique graph whose least eigenvalue attains the minimum among all graphs in Tnc
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize the unique graph whose least eigenvalue attains the minimum among all graphs in Tnc
In this paper we establish some upper bounds for the largest of min-imum degree eigenvalues and a lo...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractThe minimum number of complete bipartite subgraphs needed to partition the edges of a graph ...
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...
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices ...
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matri...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
In this paper we establish some upper bounds for the largest of min-imum degree eigenvalues and a lo...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractThe minimum number of complete bipartite subgraphs needed to partition the edges of a graph ...
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...
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices ...
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matri...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
In this paper we establish some upper bounds for the largest of min-imum degree eigenvalues and a lo...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractThe minimum number of complete bipartite subgraphs needed to partition the edges of a graph ...
Add to ORKG