Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs

Hongying Lin, Biao Mo, Bo Zhou and Weiming Weng

Applied Mathematics and Computation, 2016, vol. 285, issue C, 217-227

Abstract: We give sharp upper bounds for the ordinary spectral radius and signless Laplacian spectral radius of a uniform hypergraph in terms of the average 2-degrees or degrees of vertices, respectively, and we also give a lower bound for the ordinary spectral radius. We also compare these bounds with known ones.

Keywords: Tensor; Eigenvalues of tensors; Uniform hypergraph; Average 2-degree; Adjacency tensor; Signless Laplacian tensor (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316302090
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:285:y:2016:i:c:p:217-227

DOI: 10.1016/j.amc.2016.03.016

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().