The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs

MaRDI QIDQ3465274zbMATH OpenFDO

Authors Jinshan Xie, Liqun Qi

Publication date 21 January 2016

Full work available at URL http://www.math.ualberta.ca/ijnam/Volume-12-2015/No-2-15/2015-02-08.pdf

zbMATH Keywords

adjacencycliquecocliqueH-eigenvaluehypergraphLaplaciansignless Laplaciantensor

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• Bounds on the spectral radius of general hypergraphs in terms of clique number
• Some upper bounds on the eigenvalues of uniform hypergraphs
• On the spectral radius of uniform weighted hypergraph
• Sharp bounds for the signless Laplacian spectral radius of uniform hypergraphs

Cited in

(7)

• Bounds on the spectral radius of uniform hypergraphs
• Bounds on the spectral radius of general hypergraphs in terms of clique number
• Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• A family of gradient methods using Householder transformation with application to hypergraph partitioning
• On spectral theory of a k-uniform directed hypergraph
• On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound

This page was built for publication: The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs

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