AbstractA simple graph is said to be reflexive if the second largest eigenvalue of a (0,1)-adjacency matrix does not exceed 2. We use graph modifications involving Smith trees to construct four classes of maximal bicyclic reflexive graphs
summary:A graph is nonsingular if its adjacency matrix $A(G)$ is nonsingular. The inverse of a nonsi...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractThe spectrum of a graph is the family of eigenvalues of its (0,1) adjacency matrix. A simple...
AbstractCacti, or treelike graphs, are graphs whose all cycles are mutually edge-disjoint. Graphs wi...
AbstractA simple graph is reflexive if its second largest eigenvalue does not exceed 2. A graph is t...
A simple graph is said to be reflexive if its second largest eigenvalue does not exceed 2. The prope...
A simple graph is reflexive if the second largest eigenvalue of its (0, 1) adja-cency matrix does no...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
A simple graph is reflexive if its second largest eigenvalue λ2 is less than or equal to 2. A graph ...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractThe energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute value...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
A simple connected non-regular graph is said to be (Formula presented.) -bidegreed, or biregular, if...
summary:A graph is nonsingular if its adjacency matrix $A(G)$ is nonsingular. The inverse of a nonsi...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractThe spectrum of a graph is the family of eigenvalues of its (0,1) adjacency matrix. A simple...
AbstractCacti, or treelike graphs, are graphs whose all cycles are mutually edge-disjoint. Graphs wi...
AbstractA simple graph is reflexive if its second largest eigenvalue does not exceed 2. A graph is t...
A simple graph is said to be reflexive if its second largest eigenvalue does not exceed 2. The prope...
A simple graph is reflexive if the second largest eigenvalue of its (0, 1) adja-cency matrix does no...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
A simple graph is reflexive if its second largest eigenvalue λ2 is less than or equal to 2. A graph ...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractThe energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute value...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
A simple connected non-regular graph is said to be (Formula presented.) -bidegreed, or biregular, if...
summary:A graph is nonsingular if its adjacency matrix $A(G)$ is nonsingular. The inverse of a nonsi...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
DOI
Add to ORKG