summary:In this paper, we have investigated some properties of the first Dirichlet eigenvalue of a bicyclic graph with boundary condition. These results can be used to characterize the extremal bicyclic graphs with the smallest first Dirichlet eigenvalue among all the bicyclic graphs with a given graphic bicyclic degree sequence with minor conditions. Moreover, the extremal bicyclic graphs with the smallest first Dirichlet eigenvalue among all the bicycle graphs with fixed $k$ interior vertices of degree at least 3 are obtained
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta...
summary:In this paper, we have investigated some properties of the first Dirichlet eigenvalue of a b...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractThe spread of a graph is defined to be the difference between the greatest eigenvalue and th...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
We study the first eigenvalue of the p- Laplacian (with 1 < p< ∞) on a quantum graph with Dirichlet ...
Abstract. We study the first eigenvalue of the p−Laplacian (with 1 < p < ∞) on a quantum graph...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractWe show that every limit point of the kth largest eigenvalues of graphs is a limit point of ...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta...
summary:In this paper, we have investigated some properties of the first Dirichlet eigenvalue of a b...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractThe spread of a graph is defined to be the difference between the greatest eigenvalue and th...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
We study the first eigenvalue of the p- Laplacian (with 1 < p< ∞) on a quantum graph with Dirichlet ...
Abstract. We study the first eigenvalue of the p−Laplacian (with 1 < p < ∞) on a quantum graph...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractWe show that every limit point of the kth largest eigenvalues of graphs is a limit point of ...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges o...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta...