The following pages link to Spectra of digraphs (Q962109):
Displaying 21 items.
- Isospectral compression and other useful isospectral transformations of dynamical networks (Q2944582) (← links)
- On the spectral radius and the energy of a digraph (Q3455662) (← links)
- Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction (Q4565944) (← links)
- A SPECTRAL RADIUS ESTIMATE AND ENTROPY OF HYPERCUBES (Q4908777) (← links)
- Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph (Q4963386) (← links)
- Complex adjacency spectra of digraphs (Q4965582) (← links)
- The NIEP (Q4973490) (← links)
- Some upper bounds for the signless Laplacian spectral radius of digraphs (Q4997211) (← links)
- Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph (Q5033336) (← links)
- Non-negative spectrum of a digraph (Q5357297) (← links)
- Spectra and energy of bipartite signed digraphs (Q5741251) (← links)
- On the restricted numerical range of the Laplacian matrix for digraphs (Q5858697) (← links)
- On the spectral radius and energy of digraphs (Q5887710) (← links)
- Some <i>α</i> -spectral extremal results for some digraphs (Q6042730) (← links)
- The first three largest values of the spectral norm of oriented bicyclic graphs (Q6063838) (← links)
- The skew spectral radius and skew Randić spectral radius of general random oriented graphs (Q6149180) (← links)
- On the sum of the k largest absolute values of Laplacian eigenvalues of digraphs (Q6169843) (← links)
- Upper bounds of spectral radius of symmetric matrices and graphs (Q6185981) (← links)
- Geometric and spectral analysis on weighted digraphs (Q6199678) (← links)
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs (Q6639846) (← links)
- Digraphs with few distinct eigenvalues (Q6650594) (← links)
