Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27719
Title: The clique and coclique numbers’ bounds based on the H-eigenvalues of uniform hypergraphs
Authors: Xie, J
Qi, L 
Keywords: Adjacency
Clique
Coclique
H-eigenvalue
Hypergraph
Laplacian
Signless laplacian
Tensor
Issue Date: 2015
Publisher: Institute for Scientific Computing and Information
Source: International journal of numerical analysis and modeling, 2015, v. 12, no. 2, p. 318-327 How to cite?
Journal: International journal of numerical analysis and modeling 
Abstract: In this paper, some inequality relations between the Laplacian/signless Laplacian H-eigenvalues and the clique/coclique numbers of uniform hypergraphs are presented. For a connected uniform hypergraph, some tight lower bounds on the largest Laplacian H+-eigenvalue and signless Laplacian H-eigenvalue related to the clique/coclique numbers are given. And some upper and lower bounds on the clique/coclique numbers related to the largest Laplacian/signless Laplacian H-eigenvalues are obtained. Also some bounds on the sum of the largest/smallest adjacency/ Laplacian/signless Laplacian H-eigenvalues of a hypergraph and its complement hypergraph are showed. All these bounds are consistent with what we have known when k is equal to 2.
URI: http://hdl.handle.net/10397/27719
EISSN: 1705-5105
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
1
Last month
Citations as of Nov 17, 2017

Page view(s)

71
Last Week
2
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.