ι1-互補圖與相關主題之研究

Abstract

我們以下的主題著重於l1-互補圖的分類。我們研究至多22點的圖型G，滿足G和它的補圖G同時皆可嵌入於half-cubes之性質；並且根據結構上的特性，給出一些l1-互補圖例子中適當的嵌入方式。

Following the program of classifying complementary l1-graphs we study those graphs G with at most 21 vertices such that both G and their complements G can be embedded into half-cubes. In addtion of structured properties, explicit embeddings for some of such pairs of graphs are given.