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 Gr, s is defined in this paper. An exact relation between ρ(G) and ρ(Gr, s) is proved, more precisely ρ(Gr,s)=(ρ(G))tsr.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
