The following pages link to (Q5648382):
Displaying 50 items.
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Two Laplacians for the distance matrix of a graph (Q389586) (← links)
- A characterization of skew Hadamard matrices and doubly regular tournaments (Q426098) (← links)
- On products and line graphs of signed graphs, their eigenvalues and energy (Q550619) (← links)
- Spectral characterization of graphs whose second largest eigenvalue is less than 1 (Q616272) (← links)
- Spectrum of Gallai graph of some graphs (Q828970) (← links)
- 5-chromatic strongly regular graphs (Q856856) (← links)
- On conjugate adjacency matrices of a graph (Q868333) (← links)
- Minimal Euclidean representations of graphs (Q965947) (← links)
- Spectral upper bounds for the order of a \(k\)-regular induced subgraph (Q984870) (← links)
- Number of walks and degree powers in a graph (Q1025536) (← links)
- Graph partitioning by eigenvectors (Q1116959) (← links)
- Permanental polynomials of graphs (Q1159214) (← links)
- A surprising property of the least eigenvalue of a graph (Q1173102) (← links)
- Spectral characterization of some graphs (Q1226505) (← links)
- Comparison of graphs by their number of spanning trees (Q1233439) (← links)
- Nonisomorphic trees with the same T-polynomial (Q1243732) (← links)
- Distance matrix polynomials of trees (Q1247981) (← links)
- Spectral conditions for the reconstructibility of a graph (Q1252246) (← links)
- Which graphs are determined by their spectrum? (Q1414143) (← links)
- Enumeration of cospectral graphs. (Q1427969) (← links)
- When can the components of NEPS of connected bipartite graphs be almost cospectral? (Q1567543) (← links)
- Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum (Q1715835) (← links)
- Unicyclic and bicyclic graphs with exactly three \(Q\)-main eigenvalues (Q1740187) (← links)
- Distance regularity of compositions of graphs. (Q1764515) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- NEPS operations on cordial graphs (Q1801699) (← links)
- Some results on graph spectra (Q1855393) (← links)
- Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs (Q1855399) (← links)
- Interlacing eigenvalues and graphs (Q1899437) (← links)
- Laplacian spectra and spanning trees of threshold graphs (Q1917274) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
- Coloring the normalized Laplacian for oriented hypergraphs (Q1979369) (← links)
- On the main spectrum of generalized Bethe trees (Q1979383) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- On symmetric and Hermitian rank distance codes (Q2077273) (← links)
- Ordering starlike trees by the totality of their spectral moments (Q2140999) (← links)
- Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues (Q2185837) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- Spectrum of anti-Gallai graph of some graphs (Q2241697) (← links)
- Cospectrality of graphs with respect to distance matrices (Q2279251) (← links)
- Turán's theorem implies Stanley's bound (Q2296007) (← links)
- Some new aspects of main eigenvalues of graphs (Q2301013) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- A new eigenvalue bound for independent sets (Q2346340) (← links)
- On the spectrum of an extremal graph with four eigenvalues (Q2509301) (← links)
- Strongly regular graphs with strongly regular decomposition (Q2639877) (← links)
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
- On the nullity number of graphs (Q5006628) (← links)
