Clique Covering Number and Clique Partition Number on the Graph of n Cycle Intermediate Spoke
Li Wan · Journal of Mathematics and Technology · 2001
In this paper, after discussing the clique covering num be r and clique partition number on the graph of the Petersen generalizing graph- n cycle intermediate spoke graph, we obtain the result that the clique cover ing number and clique partition number of the graph are equal. And then, we prov ide the computational formula of the graph.