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

DOI10.1155/2021/5805239zbMATH Open1471.05062OpenAlexW3201522304MaRDI QIDQ2232678FDOQ2232678

Qiannan Niu, Lei Zhang, Haizhen Ren

Publication date: 8 October 2021

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/5805239

Recommendations

• Maximizing spectral radii of uniform hypergraphs with few edges
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
• Bounds on the spectral radius of general hypergraphs in terms of clique number
• Spectral radius of uniform hypergraphs
• New bounds for the spectral radius of uniform hypergraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Hypergraphs (05C65)

Cites Work

• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Maximizing spectral radii of uniform hypergraphs with few edges
• Spectra of uniform hypergraphs
• Some spectral properties of uniform hypergraphs
• Hypergraph theory. An introduction
• The extremal spectral radii of \(k\)-uniform supertrees
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
• Some upper bounds on the eigenvalues of uniform hypergraphs
• On bags and bugs
• Title not available (Why is that?)
• Upper bounds for \(H\)- and \(Z\)-spectral radii of uniform hypergraphs
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
• The spectra of uniform hypertrees
• The maximum spectral radii of uniform supertrees with given degree sequences
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• On the \(\alpha\)-index of graphs with pendent paths
• The first two largest spectral radii of uniform supertrees with given diameter
• The largest spectral radius of uniform hypertrees with a given size of matching
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• The matching polynomials and spectral radii of uniform supertrees
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices

This page was built for publication: Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232678)