AbstractConnected graphs in which the number of edges equals the number of vertices plus one are called bicyclic graphs. In this paper, all bicyclic graphs whose second largest eigenvalue does not exceed 1 have been determined
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractA simple graph is said to be reflexive if the second largest eigenvalue of a (0,1)-adjacency...
AbstractA biclique in a graph Γ is a complete bipartite subgraph of Γ. We give bounds for the maximu...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractLet λ1,λ2,…,λn be the eigenvalues of a graph G of order n. The energy of G is defined as E(G...
summary:In this paper, we have investigated some properties of the first Dirichlet eigenvalue of a b...
Abstract Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest La...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractA simple graph is said to be reflexive if the second largest eigenvalue of a (0,1)-adjacency...
AbstractA biclique in a graph Γ is a complete bipartite subgraph of Γ. We give bounds for the maximu...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractLet λ1,λ2,…,λn be the eigenvalues of a graph G of order n. The energy of G is defined as E(G...
summary:In this paper, we have investigated some properties of the first Dirichlet eigenvalue of a b...
Abstract Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest La...
AbstractA graph G of order n is called a bicyclic graph if G is connected and the number of edges of...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
DOI
Add to ORKG