Clique Partitions of Glued Graphs

Chariya Uiyyasathian, Uthoomporn Jongthawonwuth

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.

Full Text: PDF

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

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.