Principal eigenvector and spectral radius of uniform hypergraphs
Combinatorics
2016-05-30 v1
Abstract
In this paper, we give some bounds for principal eigenvector and spectral radius of connected uniform hypergraphs in terms of vertex degrees, the diameter, and the number of vertices and edges.
Keywords
Cite
@article{arxiv.1605.08688,
title = {Principal eigenvector and spectral radius of uniform hypergraphs},
author = {Haifeng Li and Jiang Zhou and Changjiang Bu},
journal= {arXiv preprint arXiv:1605.08688},
year = {2016}
}