Constructing cospectral hypergraphs
From MaRDI portal
Cites work
- A general product of tensors with applications
- Computing hypermatrix spectra with the Poisson product formula
- Constructing cospectral graphs
- Cospectral graphs and regular orthogonal matrices of level 2
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- E-characteristic polynomials of tensors
- E-cospectral hypergraphs and some hypergraphs determined by their spectra
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Generation of isospectral graphs
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Joins of hypergraphs and their spectra
- Most tensor problems are NP-hard
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- On the Laplacian spectrum of k-uniform hypergraphs
- On the spectrum of hypergraphs
- Some new trace formulas of tensors with applications in spectral hypergraph theory
- Spectra of hypergraphs and applications
- Spectra of uniform hypergraphs
- Spectral radius of uniform hypergraphs
- The maximum spectral radius of uniform hypergraphs with given number of pendant edges
- The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
- The spectra of uniform hypertrees
This page was built for publication: Constructing cospectral hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012678)
