Principal eigenvector of the signless Laplacian matrix
From MaRDI portal
Publication:1983875
DOI10.1007/s40314-021-01440-7zbMath1476.05110arXiv2004.14809OpenAlexW3129683042MaRDI QIDQ1983875
Publication date: 10 September 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14809
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
- Spectra of uniform hypergraphs
- Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
- A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
- Principal eigenvectors and spectral radii of uniform hypergraphs
- Spectra of hypergraphs and applications
- On maximal entries in the principal eigenvector of graphs
- The spectrum of a class of uniform hypergraphs
- On the spectrum of hypergraphs
- Spectra of cycle and path families of oriented hypergraphs
- Spectral radius of uniform hypergraphs
- Eigenvectors and eigenvalues of non-regular graphs
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- Energies of Hypergraphs
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- Characterizing graphs of maximum principal ratio
- On distance spectral radius of hypergraphs
- Centrality-friendship paradoxes: when our friends are more important than us
- Principal eigenvectors of general hypergraphs
- Most Tensor Problems Are NP-Hard
- Spectral properties of oriented hypergraphs
This page was built for publication: Principal eigenvector of the signless Laplacian matrix
