## Abstract

Let A(H) be the adjacency tensor (hypermatrix) of uniform hypergraph H. The maximum modulus of the eigenvalues of A(H) is called the spectral radius of H, denoted by ρ(H). In this paper, a conjecture concerning the spectral radii of linear bicyclic uniform hypergraphs is solved, with these results the hypergraph with the largest spectral radius is completely determined among the linear bicyclic uniform hypergraphs. For a t-uniform hypergraph G its generalized power r-uniform hypergraph G^{r, s} is defined in this paper. An exact relation between ρ(G) and ρ(G^{r, s}) is proved, more precisely ρ(G^{r,s})=(ρ(G))^{[Formula presented]}.

Original language | English |
---|---|

Pages (from-to) | 661-668 |

Number of pages | 8 |

Journal | Applied Mathematics and Computation |

Volume | 338 |

DOIs | |

Publication status | Published - 1 Dec 2018 |

## Keywords

- Adjacency tensor
- Generalized power uniform hypergraph
- Linear bicyclic hypergraph
- Spectral radius
- Uniform hypergraph

## ASJC Scopus subject areas

- Computational Mathematics
- Applied Mathematics