  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.
