@Article{IJNAM-12-2,
author = {},
title = {The Clique and Coclique Numbers' Bounds Based on the H-Eigenvalues of Uniform Hypergraphs},
journal = {International Journal of Numerical Analysis and Modeling},
year = {2015},
volume = {12},
number = {2},
pages = {318--327},
abstract = {<p style="text-align: justify;">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.</p>},
issn = {2617-8710},
doi = {https://doi.org/2015-IJNAM-491},
url = {https://global-sci.com/article/83292/the-clique-and-coclique-numbers-bounds-based-on-the-h-eigenvalues-of-uniform-hypergraphs}
}