Eigenvalues of complete multipartite graphs
From MaRDI portal
Cites work
Cited in
(18)- Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum
- Spectrum of free-form Sudoku graphs
- Spectral extremal graphs for intersecting cliques
- Joins of hypergraphs and their spectra
- The trace norm of r-partite graphs and matrices
- Complementary eigenvalues of graphs
- On a conjecture of spectral extremal problems
- scientific article; zbMATH DE number 7404405 (Why is no real title available?)
- Tripartite graphs with energy aggregation
- Refinement on Spectral Turán’s Theorem
- The unique spectral extremal graph for intersecting cliques or intersecting odd cycles
- Node and link vulnerability in complete multipartite networks
- On complete multipartite orderenergetic graphs
- Qualitative, statistical, and extreme properties of spectral indices of signable pseudo-invertible graphs
- Inverse of the squared distance matrix of a complete multipartite graph
- On the eigenvalues of some signed graphs
- On orderenergetic complete multipartite graphs
- Maximal energy of subdivisions of graphs with a fixed chromatic number
This page was built for publication: Eigenvalues of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442357)