An upper bound for the clique number using clique ceiling numbers
Combinatorics
2019-06-04 v1
Abstract
In this article we present the idea of clique ceiling numbers of the vertices of a given graph that has a universal vertex. We follow up with a polynomial-time algorithm to compute an upper bound for the clique number of such a graph using clique ceiling numbers. We compare this algorithm with some upper bound formulas for the clique number.
Keywords
Cite
@article{arxiv.1906.00589,
title = {An upper bound for the clique number using clique ceiling numbers},
author = {R. Dharmarajan and D. Ramachandran},
journal= {arXiv preprint arXiv:1906.00589},
year = {2019}
}
Comments
09 pages