Maximizing spectral radii of uniform hypergraphs with few edges

Abstract

In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given girth, linear or power bicyclic hypergraphs, respectively.

References in corpus (1)

• The extremal spectral radii of $k$-uniform supertrees

Cited by in corpus (16)

• The $H$-spectrum of a generalized power hypergraph
• The trace and Estrada index of uniform hypergraphs with cut vertices
• High-ordered spectral characterization of unicyclic graphs
• A Bound on the Spectral Radius of Hypergraphs with $e$ Edges
• The trace of uniform hypergraphs with application to Estrada index
• Inverse Perron values and connectivity of a uniform hypergraph
• The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• The smallest spectral radius of bicyclic uniform hypergraphs with a given size
• The linear unicyclic hypergraph with the second or third largest spectral radius
• Uniform hypergraphs with the first two smallest spectral radii
• The matching polynomials and spectral radii of uniform supertrees
• Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
• The stabilizing index and cyclic index of coalescence and Cartesian product of uniform hypergraphs
• The bounds of the spectral radius of general hypergraphs in terms of clique number
• A homogeneous polynomial associated with general hypergraphs and its applications
• On the spectral radii of the unicyclic hypergraphs with fixed matching number