Abstract

The spectral theory of graphs and hypergraphs is an active and important research field in graph and hypergraph theory. And it has extensive applications in the fields of computer science, communication networks, information science, statistical mechanics and quantum chemistry, etc. The H-eigenvalues of a hypergraph are its H-eigenvalues of adjacent tensor. This paper presents some upper and lower bounds on the largest H-eigenvalue of r-hypergraphs.

Full Text

Paper version not known (Free)

Published Version

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 call

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.