Clique of constant size It is well known that Clique is a NP-Complete problem, But given some constant value K, finding whether a graph G has a clique of size K, is always a log-space (L) class problem?

Yes. For any _fixed_ $k$, you can enumerate all of the $k$-element subsets in logarithmic space, and check whether each of them is a clique.