Abstract

A glued graph at $K_2$-clone ($K_3$-clone) results from combining two
vertex-disjoint graphs by identifying an edge (a triangle) of each original
graph. The clique covering numbers of these desired glued graphs
have been investigated recently. Analogously, we
obtain bounds of the clique partition numbers of glued graphs at
$K_2$-clones and $K_3$-clones in terms of the clique partition numbers of their
original graphs. Moreover, we characterize glued
graphs satisfying such bounds.

This work is licensed under a Creative Commons Attribution 4.0 License.