Abstract
Abstract Given a hypergraph H of order n with rank k ≥ 2, denote by D ( H ) and A ( H ) the degree diagonal tensor and the adjacency tensor of H, respectively, of order k and dimension n. For real number α with 0 ≤ α α D ( H ) + ( 1 − α ) A ( H ) . First, we establish a upper bound on the α-spectral radius of connected irregular hypergraphs. Then we propose three local transformations of hypergraphs that increase the α-spectral radius. We also identify the unique hypertree with the largest α-spectral radius and the unique hypergraph with the largest α-spectral radius among hypergraphs of given number of pendent edges, and discuss the unique hypertrees with the next largest α-spectral radius and the unicyclic hypergraphs with the largest α-spectral radius.
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.
