Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number (Q2232678)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number |
scientific article; zbMATH DE number 7407979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number |
scientific article; zbMATH DE number 7407979 |
Statements
Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number (English)
0 references
8 October 2021
0 references
Summary: In this paper, we defined two classes of hypergraphs, hyperbugs and kite hypergraphs. We show that balanced hyperbugs maximize the spectral radii of hypergraphs with fixed number of vertices and diameter and kite hypergraphs minimize the spectral radii of hypergraphs with fixed number of vertices and clique number.
0 references
0.853941798210144
0 references
0.8486850261688232
0 references
0.8420256972312927
0 references
0.8389055132865906
0 references
0.8364356160163879
0 references
