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

DOI10.1016/J.LAA.2020.09.039zbMATH Open1461.15024arXiv2007.13282OpenAlexW3089604926MaRDI QIDQ2228103FDOQ2228103

Authors: Cunxiang Duan, Ligong Wang 

Publication date: 16 February 2021

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

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.

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

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

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)

Cites Work

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

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)