Year: 2015
International Journal of Numerical Analysis and Modeling, Vol. 12 (2015), Iss. 2 : pp. 318–327
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2015-IJNAM-491
International Journal of Numerical Analysis and Modeling, Vol. 12 (2015), Iss. 2 : pp. 318–327
Published online: 2015-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 10
Keywords: H-eigenvalue clique coclique hypergraph tensor signless Laplacian Laplacian adjacency.