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

DOI10.1155/2021/5805239MaRDI QIDQ2232678zbMATH OpenOpenAlexFDO

Authors Qiannan Niu, Haizhen Ren, Lei Zhang

Publication date 8 October 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 5280010 (Why is no real title available?)
• Hypergraph theory. An introduction
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
• Maximizing spectral radii of uniform hypergraphs with few edges
• On bags and bugs
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• On the \(\alpha\)-index of graphs with pendent paths
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
• Some spectral properties of uniform hypergraphs
• Some upper bounds on the eigenvalues of uniform hypergraphs
• Spectra of uniform hypergraphs
• The extremal spectral radii of \(k\)-uniform supertrees
• 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 matching polynomials and spectral radii of uniform supertrees
• The maximum spectral radii of uniform supertrees with given degree sequences
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices
• The spectra of uniform hypertrees
• Upper bounds for \(H\)- and \(Z\)-spectral radii of uniform hypergraphs

Cited in

(2)

• On bags and bugs
• Hypergraphs with spectral radius between two limit points

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)