High-order spectral characterizations of graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3627232 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- A Harary-Sachs theorem for hypergraphs
- A note on the nullity of unicyclic signed graphs
- A reduction formula for the characteristic polynomial of hypergraph with pendant edges
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- All eigenvalues of the power hypergraph and signed subgraphs of a graph
- Constructing cospectral graphs
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- Developments on spectral characterizations of graphs
- Eigenvalues of a real supersymmetric tensor
- Laplacian matrices of graphs: A survey
- No starlike trees are cospectral
- Spectra of unicyclic graphs
- Spectra of uniform hypergraphs
- Spectral fundamentals and characterizations of signed directed graphs
- Spectral moments of hypertrees and their applications
- Spektren endlicher Grafen
- The lollipop graph is determined by its spectrum
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
- Which graphs are determined by their spectrum?
This page was built for publication: High-order spectral characterizations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014507)