Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
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...
Main Authors: | Fan Yi-Zheng, Tan Ying-Ying, Peng Xi-Xi, Liu An-Hong |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1906 |
Similar Items
-
On the α-Spectral Radius of Uniform Hypergraphs
by: Guo Haiyan, et al.
Published: (2020-05-01) -
Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model
by: Ghoshdastidar, Debarghya
Published: (2018) -
On $\alpha$-spectral theory of a directed k-uniform hypergraph
by: Gholam-Hasan Shirdel, et al.
Published: (2020-09-01) -
A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs
by: Chuang Lv, et al.
Published: (2020-02-01) -
A general result on the spectral radii of nonnegative k-uniform tensors
by: Chuang Lv, et al.
Published: (2020-02-01)