四點完全圖的最佳填塞與覆蓋之研究

Abstract

在本論文中，我們使用最少的剩餘和最少的加入去分別描述最大的填塞與最小的覆蓋問題。如此一來，我們可以清楚地看出這兩類問題的關連性，也可以利用他們去建構其他的設計，例如二度相關之群分設計。

In this thesis, we study the optimal packing and covering of Kv with quadruples (K4). Mainly, minimum leave and minimum padding are utilized to describe a maximum packing and a minimum covering respectively. Other than the general optimal packing and covering, we also consider the optimal packing and covering in which their leave and padding are restricted to be simple respectively.