Clique Partitions of Glued Graphs | Zendy

Chariya Uiyyasathian | Zendy; Uthoomporn Jongthawonwuth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Clique Partitions of Glued Graphs

Author(s) -

Chariya Uiyyasathian,

Uthoomporn Jongthawonwuth

Publication year - 2010

Publication title -

journal of mathematics research

Language(s) - English

Resource type - Journals

eISSN - 1916-9809

pISSN - 1916-9795

DOI - 10.5539/jmr.v2n2p104

Subject(s) - combinatorics , mathematics , clique sum , partition (number theory) , disjoint sets , clique , split graph , cograph , block graph , clone (java method) , clique number , chordal graph , discrete mathematics , graph , 1 planar graph , dna , biology , genetics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research