On the Adjacency and Seidel Spectra of Hypergraphs
Liya Jess KurianChithra A V
Liya Jess KurianChithra A V
Sep 2023
0被引用
0笔记
开学季活动火爆进行中，iPad、蓝牙耳机、拍立得、键盘鼠标套装等你来拿
摘要原文
A hypergraph generalizes the concept of an ordinary graph. In an ordinary graph, edges connect pairs of vertices, whereas in a hypergraph, hyperedges can connect multiple vertices at a time. In this paper, we obtain a relationship between the characteristic polynomial of Seidel and adjacency matrices of hypergraph and also compute all the eigenvalues of some k-uniform hypergraphs. Moreover, we estimate the adjacency and Seidel spectra of the uniform double hyperstar and sunflower hypergraph. In addition to that, we determine the Seidel spectrum and main Seidel eigenvalues of hyperstar.
