Principal Eigenvector of the Signless Laplacian Matrix
Combinatorics
2020-05-01 v1 Spectral Theory
Abstract
In this paper, we study the entries of the principal eigenvector of the signless Laplacian matrix of a hypergraph. More precisely, we obtain bounds for this entries. These bounds are computed trough other important parameters, such as spectral radius, maximum and minimum degree. We also introduce and study a new parameter related to edges of the hypergraph. This parameter is a spectral measure of a structural characteristic that can be thought of as an edge-variant of regularity.
Cite
@article{arxiv.2004.14809,
title = {Principal Eigenvector of the Signless Laplacian Matrix},
author = {Kauê Cardoso},
journal= {arXiv preprint arXiv:2004.14809},
year = {2020}
}
Comments
Keywords: Hypergraph; Signless Laplacian matrix; Principal eigenvector; Spectral radius. arXiv admin note: text overlap with arXiv:1909.00246