The linear unicyclic hypergraph with the second or third largest spectral radius (Q2663282)
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: The linear unicyclic hypergraph with the second or third largest spectral radius |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The linear unicyclic hypergraph with the second or third largest spectral radius |
scientific article |
Statements
The linear unicyclic hypergraph with the second or third largest spectral radius (English)
0 references
16 April 2021
0 references
The spectral radius of a uniform hypergraph is defined to be the adjacency tensor of the hypergraph. It is known that the unique unicyclic graph 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, the unique linear unicyclic hypergraphs with the second and third largest spectral radius are determined, where the first hypergraph is a power hypergraph and the latter hypergraph is a non-power hypergraph.
0 references
linear unicyclic hypergraph
0 references
adjacency tensor
0 references
spectral radius
0 references
weighted incident matrix
0 references
0 references
0.8763030171394348
0 references
0.8610670566558838
0 references
0.858623206615448
0 references
0.8557458519935608
0 references
0.8376546502113342
0 references
