Abstract
For 0≤α<1, the Aα-spectral radius of a k-uniform hypergraph G is defined to be the spectral radius of the tensor Aα(G):=αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal and adjacency tensors of G, respectively. This paper presents several lower bounds for the difference between the Aα-spectral radius and an average degree kmn of a connected k-uniform hypergraph G with n vertices and m edges, which are considered as measures of irregularity of G. Moreover, two lower bounds on the Aα-spectral radius are obtained in terms of the maximum and minimum degrees of uniform hypergraphs.
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.
