Perfect colourings of hypergraphs
From MaRDI portal
Cites work
- A general product of tensors with applications
- A survey on the spectral theory of nonnegative tensors.
- Adjacency spectra of random and complete hypergraphs
- Algebraic properties of perfect structures
- Analogue of the identity Log Det = Trace Log for resultants
- Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
- Discriminants, resultants, and multidimensional determinants
- Eigenvalues of a real supersymmetric tensor
- Finite common coverings of graphs
- Finite common coverings of pairs of regular graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Hypergraph coverings and their zeta functions
- Multiplicities of tensor eigenvalues
- On completely regular codes
- On some properties of the determinants of tensors
- Perfect 2‐colorings of Hamming graphs
- Spectra of uniform hypergraphs
- The spectral property of hypergraph coverings
This page was built for publication: Perfect colourings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983389)