
doi: 10.3390/math10060941
SLEE has various applications in a large variety of problems. The signless Laplacian Estrada index of a hypergraph H is defined as SLEE(H)=∑i=1neλi(Q), where λ1(Q),λ2(Q),…,λn(Q) are the eigenvalues of the signless Laplacian matrix of H. In this paper, we characterize the unique r-uniform unicyclic hypergraphs with maximum and minimum SLEE.
r-uniform unicyclic hypergraph, QA1-939, signless Laplacian matrix, signless Laplacian Estrada index, Mathematics, semi-edge walk
r-uniform unicyclic hypergraph, QA1-939, signless Laplacian matrix, signless Laplacian Estrada index, Mathematics, semi-edge walk
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
