Perfect Glued Graphs at Complete Clones

Perfect Glued Graphs at Complete Clones
复制标题

完整克隆上的完美粘合图

DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Supaporn Saduakdee
Supaporn Saduakdee
中科院分区：
--
文献类型：
--
作者：
C. Uiyyasathian;Supaporn Saduakdee

文献摘要

被引文献

相似文献

一个图G称为完美图，如果它的每一个导出子图的色数和团数都相同。一个胶合图的结果是通过识别两个图的连通同构子图来组合两个顶点不相交的图。研究了克隆图是完全图的胶合图的完美性。我们的结果推广了弦图的简单消去序。
A graph G is called perfect if the chromatic number and the clique number have the same value for every of itsinduced subgraph. A glued graph results from combining two vertex-disjoint graphs by identifying connectedisomorphic 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 the simplicialelimination ordering which is a characterization of chordal graphs.