Maximizing spectral radii of uniform hypergraphs with few edges
classification
🧮 math.CO
keywords
hypergraphsspectraledgesgivenlinearmaximumpowerradii
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.