AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-paths, where 2≤n<∞. In this paper, all generalized θ-graphs whose second largest eigenvalues do not exceed 1 have been determined
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving t...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
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...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractLet λ1(G) denote the largest eigenvalue of the adjacency matrix and let μ1(G) denote the lar...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving t...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
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...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractLet λ1(G) denote the largest eigenvalue of the adjacency matrix and let μ1(G) denote the lar...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving t...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
DOI
Add to ORKG