Abstract
We determine the unique hypergraphs with minimum distance Laplacian spectral radius among connected k-uniform hypergraphs and k-uniform hypertrees, respectively. We also determine the unique hypergraphs with minimum distance signless Laplacian spectral radius among connected k-uniform hypergraphs, k-uniform hypertrees, and connected k-uniform hypergraphs with given number of pendant edges, respectively. We propose a graft transformation for uniform hypergraphs that increases the distance Laplacian (distance signless Laplacian, respectively) spectral radius, and as applications, we determine the unique power hypertrees with maximum distance Laplacian (distance signless Laplacian, respectively) spectral radius.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.