E-cospectral hypergraphs and some hypergraphs determined by their spectra

DOI10.1016/J.LAA.2014.07.020zbMATH Open1300.05195arXiv1406.1085OpenAlexW2963929755MaRDI QIDQ401202FDOQ401202

Authors: Changjiang Bu, Jiang Zhou, Yimin Wei 

Publication date: 26 August 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Two $k$-uniform hypergraphs are said to be cospectral (E-cospectral), if their adjacency tensors have the same characteristic polynomial (E-characteristic polynomial). A $k$-uniform hypergraph $H$ is said to be determined by its spectrum, if there is no other non-isomorphic $k$-uniform hypergraph cospectral with $H$. In this note, we give a method for constructing E-cospectral hypergraphs, which is similar with Godsil-McKay switching. Some hypergraphs are shown to be determined by their spectra.

Full work available at URL: https://arxiv.org/abs/1406.1085

Recommendations

• Spectra of uniform hypergraphs
• Joins of hypergraphs and their spectra
• Some spectral properties of uniform hypergraphs
• Spectral properties of general hypergraphs
• The spectrum of a class of uniform hypergraphs

zbMATH Keywords

adjacency tensorcospectral hypergraphE-cospectral hypergraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65)

Cites Work

• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Eigenvalues of a real supersymmetric tensor
• Constructing cospectral graphs
• Eigenvalues and invariants of tensors
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
• Spectra of uniform hypergraphs
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
• Algebraic connectivity of an even uniform hypergraph
• A general product of tensors with applications
• On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
• Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
• The inverse, rank and product of tensors
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• E-characteristic polynomials of tensors

Cited In (9)

• The Drazin inverse of an even-order tensor and its application to singular tensor equations
• Joins of hypergraphs and their spectra
• Extension of Moore–Penrose inverse of tensor via Einstein product
• Signed \(k\)-uniform hypergraphs and tensors
• Inverse Perron values and connectivity of a uniform hypergraph
• Numerical study on Moore-Penrose inverse of tensors via Einstein product
• On spectral theory of a k-uniform directed hypergraph
• Non-uniform Hypergraphs
• Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs

This page was built for publication: E-cospectral hypergraphs and some hypergraphs determined by their spectra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401202)