Bounds on the spectral radius of general hypergraphs in terms of clique number

DOI10.1016/J.LAA.2020.09.039MaRDI QIDQ2228103zbMATH OpenOpenAlexFDO

Authors Cunxiang Duan, Ligong Wang

Publication date 16 February 2021

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.13282

zbMATH Keywords

spectral radiusclique numberhypergraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65) Miscellaneous inequalities involving matrices (15A45)

Abstract: The spectral radius (or the signless Laplacian spectral radius) of a general hypergraph is the maximum modulus of the eigenvalues of its adjacency (or its signless Laplacian) tensor. In this paper, we firstly obtain a lower bound of the spectral radius (or the signless Laplacian spectral radius) of general hypergraphs in terms of clique number. Moreover, we present a relation between a homogeneous polynomial and the clique number of general hypergraphs. As an application, we finally obtain an upper bound of the spectral radius of general hypergraphs in terms of clique number.

Recommendations

• A homogeneous polynomial associated with general hypergraphs and its applications
• Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs
• New bounds for the spectral radius of uniform hypergraphs
• Bounds on the spectral radius of uniform hypergraphs
• Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees

Cites work

• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• A homogeneous polynomial associated with general hypergraphs and its applications
• Bounds and conjectures for the signless Laplacian index of graphs
• Cliques and the spectral radius
• Eigenvalues of a real supersymmetric tensor
• Laplacian spectral bounds for clique and independence numbers of graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Maximizing spectral radii of uniform hypergraphs with few edges
• More spectral bounds on the clique and independence numbers
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
• Some properties of the spectral radius for general hypergraphs
• Spectra of general hypergraphs
• Spectral bounds for the clique and independence numbers of graphs
• The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs
• The \(\alpha \)-spectral radius of \(f\)-connected general hypergraphs
• The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs
• The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
• The maximum clique and the signless Laplacian eigenvalues
• The maximum spectral radii of uniform supertrees with given degree sequences
• Upper bounds for \(H\)- and \(Z\)-spectral radii of uniform hypergraphs
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors

Cited in

(8)

• Spectral radius and clique partitions of graphs
• The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs
• The characteristic polynomials of uniform double hyperstars and uniform hypertriangles
• Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
• The high order spectrum of a graph and its applications in graph colouring and clique counting
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• Some properties of the spectral radius for general hypergraphs
• A homogeneous polynomial associated with general hypergraphs and its applications

This page was built for publication: Bounds on the spectral radius of general hypergraphs in terms of clique number

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