In this paper, we consider total clique covers and uniform intersection numbers on multifamilies. We determine the uniform intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the uniform intersection numbers of some families of graphs. We also deal with the \(NP\)-completeness of uniform intersection numbers.