Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving the smallest ordinary or the largest normalized Laplacian eigenvalue of G are presented
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving t...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving th...
AbstractLet λ(G) be the least eigenvalue of a graph G. A real number r has the induced subgraph prop...
AbstractA graph H is imbedded in a graph G if a subset of the vertices of G determines a subgraph is...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractLet G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which in...
Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which ind...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractThe least eigenvalue of the 0-1 adjacency matrix of a graph is denoted λ G. In this paper al...
We show how all eigenvalues of a power hypergraph $G^{(k)}$ can be generated from the eigenvalues of...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving t...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving th...
AbstractLet λ(G) be the least eigenvalue of a graph G. A real number r has the induced subgraph prop...
AbstractA graph H is imbedded in a graph G if a subset of the vertices of G determines a subgraph is...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractLet G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which in...
Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which ind...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractThe least eigenvalue of the 0-1 adjacency matrix of a graph is denoted λ G. In this paper al...
We show how all eigenvalues of a power hypergraph $G^{(k)}$ can be generated from the eigenvalues of...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
summary:For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
DOI
Add to ORKG