On Clique Graphs and Clique Regular Graphs

Robert R. Petro, Connor M. Phillips

If $\hat{I}“$ is a graph for which every edge is in exactly one clique of order $\ddot{I}‰$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of th…