English

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

Combinatorics 2016-05-20 v2

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 22-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

Cite

@article{arxiv.1602.03230,
  title  = {Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs},
  author = {Hongying Lin and Biao Mo and Bo Zhou and Weiming Weng},
  journal= {arXiv preprint arXiv:1602.03230},
  year   = {2016}
}