Spectral bounds for the independence number of graphs and even uniform hypergraphs

Key Points

• The aim is to establish spectral upper bounds for the independence number in even uniform hypergraphs and graphs.
• Develop spectral upper bounds for independence number in even uniform hypergraphs.
• Extend the Hoffman bound to apply to even uniform hypergraphs.
• Provide a spectral condition to determine various graph parameters.
• Established new upper bounds for independence numbers in even uniform hypergraphs.
• Extended the Hoffman bound for the Lovász number from regular to general graphs.
• Introduced conditions to evaluate Shannon capacity and Lovász number.