The following pages link to (Q3215235):
Displaying 18 items.
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- Beyond graph energy: norms of graphs and matrices (Q739093) (← links)
- Bounds on graph spectra (Q792343) (← links)
- Walks and the spectral radius of graphs (Q852649) (← links)
- Eigenvalues and colorings of digraphs (Q962116) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Spectral bounds for the clique and independence numbers of graphs (Q1079582) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Eigenvalues and chromatic number of a signed graph (Q2020660) (← links)
- Measure-theoretic bounds on the spectral radius of graphs from walks (Q2032249) (← links)
- A Cvetković-type theorem for coloring of digraphs (Q2052174) (← links)
- Colorings in digraphs from the spectral radius (Q2080237) (← links)
- Analytic methods for uniform hypergraphs (Q2250784) (← links)
- On subsets of the hypercube with prescribed Hamming distances (Q2299612) (← links)
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs (Q2347469) (← links)
- The trace norm of \(r\)-partite graphs and matrices (Q2351823) (← links)
- New eigenvalue bound for the fractional chromatic number (Q6201030) (← links)
