2021
DOI: 10.48550/arxiv.2107.03837
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Estrada index of hypergraphs via eigenvalues of tensors

Abstract: A uniform hypergraph H is corresponding to an adjacency tensor A H . We define an Estrada index of H by using all the eigenvalues λ 1 , . . . , λ k of A H as k i=1 e λi . The bounds for the Estrada indices of uniform hypergraphs are given. And we characterize the Estrada indices of m-uniform hypergraphs whose spectra of the adjacency tensors are m-symmetric. Specially, we characterize the Estrada indices of uniform hyperstars.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…Recently Clark and Cooper [5] generalized the Harary-Sachs theorem of graphs to uniform hypergraphs by using Veblen hypergraphs. Sun-Zhou-Bu [33] generalized the Estrada index of graphs to uniform hypergraphs, which is closely related to the traces of the adjacency tensor. Definition 1.1 ([33]).…”
Section: Introductionmentioning
confidence: 99%
“…Recently Clark and Cooper [5] generalized the Harary-Sachs theorem of graphs to uniform hypergraphs by using Veblen hypergraphs. Sun-Zhou-Bu [33] generalized the Estrada index of graphs to uniform hypergraphs, which is closely related to the traces of the adjacency tensor. Definition 1.1 ([33]).…”
Section: Introductionmentioning
confidence: 99%
“…In 2021, Sun, Zhou and Bu [27] generalized the definition of the Estrada index to uniform hypergraphs and obtained some bounds for it. Moreover, they studied the Estrada indices of some specific r-uniform hypergraphs.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, motivated by [19,27], we introduce the signless Laplacian Estrada index SLEE(H) and the Laplacian Estrada index LEE(H) of an r-uniform hypergraph H. We also obtain an order r + 1 trace formula of the (signless) Laplacian tensor of H. Further, we establish some bounds on SLEE(H) and LEE(H). In general, the problem of finding good bounds is hindered by the fact that eigenvalues of hypergraphs may be nonreal.…”
Section: Introductionmentioning
confidence: 99%