Clique Coverings of Glued Graphs at Complete Clones
نویسندگان
چکیده
A clique covering of a graph G is a set of cliques of G in which each edge of G is contained in at least one clique. The smallest cardinality of clique coverings of G is called the clique covering number of G. A glued graph results from combining two nontrivial vertex-disjoint graphs by identifying nontrivial connected isomorphic subgraphs of both graphs. Such subgraphs are referred to as the clones. The two nontrivial vertexdisjoint graphs are referred to the original graphs. In this paper, we investigate bounds of clique covering numbers of glued graphs at clone which is isomorphic to Kn in terms of clique covering numbers of their original graphs, and give a characterization of a glued graph with the clique covering number of each possible value. Mathematics Subject Classification: 05C69, 05C70, 05C99
منابع مشابه
Perfect Glued Graphs at Complete Clones
A graph G is called perfect if the chromatic number and the clique number have the same value for every of its induced subgraph. A glued graph results from combining two vertex-disjoint graphs by identifying connected isomorphic subgraphs of both graphs. Such subgraphs are referred to as the clones. We study the perfection of glued graphs whose clones are complete graphs. Our result generalizes...
متن کاملClique Partitions of Glued Graphs
A glued graph at K2-clone (K3-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 K2-clones and K3-clones in terms of the clique partition numbers of their orig...
متن کاملClique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique in C. The clique covering (partition) number cc(G) (cp(G)) of G is the minimum size of a clique covering (partition) of G. This paper gives alternative proofs, using a unified approach, for the results on the clique c...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کامل