The linear unicyclic hypergraph with the second or third largest spectral radius
Combinatorics
2021-08-31 v1
Abstract
The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor the hypergraph. It is known that the unique unicyclic hypergraph with the largest spectral radius is a nonlinear hypergraph, and the unique linear unicyclic hypergraph with the largest spectral radius is a power hypergraph. In this paper we determine the the unique linear unicyclic hypergraph with the second or third largest spectral radius, where the former hypergraph is a power hypergraph and the latter hypergraph is a non-power hypergraph.
Keywords
Cite
@article{arxiv.2002.04415,
title = {The linear unicyclic hypergraph with the second or third largest spectral radius},
author = {Chao Ding and Yi-Zheng Fan and Jiang-Chao Wan},
journal= {arXiv preprint arXiv:2002.04415},
year = {2021}
}