报告内容
框架 |
It is known that for a simple graph the bipartiteness can be characterized by the spectrum of the adjacency matrix, Laplaican matrix or signless Laplacian matrix of the graph. Shao et al. characterized the odd-bipartiteness of even uniform hypergraphs by the H-spectrum, spectrum of the adjacency tensor, Laplacian tensor or signless Laplacian tensor of the hypergraph. In this talk we find two differences between the Laplacian spectrum and signless Laplaican spectrum of simple graphs and hypergraphs. We also characterized the non-odd-bipartiteness of hypergraphs by means of the spectrum. |
