Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number

HIGHLIGHTS

• who: Qiannan Niu et al. from the School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai, China have published the article: Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number, in the Journal: Discrete Dynamics in Nature and Society of 10/09/2021
• what: The authors show that balanced hyperbugs maximize the spectral radii of hypergraphs with fixed number of vertices and diameter and kite hypergraphs minimize the spectral radii of hypergraphs with fixed number of vertices and clique number. To complete the proof, the authors show that there . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.