On the Estrada Index and Spectral Properties of k-Uniform Hypergraphs
Abstract
Various properties of a hypergraph can be explored through its spectrum. In this paper,we estimate the bound for the sum of t,\,t∈[1,n], largest eigenvalues of a k-uniform hypergraph of order n. Also, we characterize the k-uniform hypergraph with two distinct eigenvalues. We establish bounds for the Estrada index of k-uniform hypergraphs based on their number of edges, order and energy. In addition, we obtain the second largest Estrada index among the unicyclic hypergraphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.