Abstract
Let and be the adjacency tensor and signless Laplacian tensor of an -uniform hypergraph . Denote by and the spectral radii of and , respectively. In this paper we present a lower bound on in terms of vertex degrees and we characterize the extremal hypergraphs attaining the bound, which solves a problem posed by Nikiforov [V. Nikiforov, Analytic methods for uniform hypergraphs, Linear Algebra Appl. 457 (2014) 455-535]. Also, we prove a lower bound on concerning degrees and give a characterization of the extremal hypergraphs attaining the bound.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.