On the spectral radii of the unicyclic hypergraphs with fixed matching number

2019/06/25 by Guanglong Yu, Yu, Guanglong, Chao Yan +5
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Matrix Theory and Algorithms #Tensor decomposition and applications

paper · pdf · doi:10.48550/arxiv.1906.10614

openalex publication_date 2019/06/25 · openalex created_date 2019/07/12 · openalex updated_date 2026/07/28

Abstract

We determine the unique hypergraphs with maximum spectral radius among all connected k-uniform (k≥ 3) unicyclic hypergraphs with matching number at least z, and among all connected k-uniform (k≥ 3) unicyclic hypergraphs with a given matching number, respectively.

Citations

• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs

Related

• The maximal spectral radius of the uniform unicyclic hypergraph with perfect matchings
• The unicyclic hypergraph with extremal spectral radius
• The first few unicyclic and bicyclic hypergraphs with larger spectral radii
• Some results on the spectral radii of uniform hypergraphs
• On the α-spectral radius of hypergraphs