由於實際資源分享問題，在此篇論文中我們考慮到控制問題的變形，稱為距離二以內的控制問題。 這篇論文架構如下：第一節、介紹基本的定義，第二節、決定DL(n;1,2)控制數。第三節、決定DL(n;1,3)控制數。第四節、決定DL(n;1,n/2)控制數。最後一節是針對一般圖形，控制數的研究。 Due to a practically resource sharing problem, we consider a variation of the domination problem in this thesis which we call the distance-two domination problem. This thesis is organized as follows. Section 1 gives basic definitions and notation. Section 2 investigates the distance-two domination of (n;1,2). Section 3 investigates the distance-two domination of (n;1,3). Section 4 investigates the distance-two domination of (n;1,n/2). We provide the integer programming method to canvass r_3,2,1(G) in the final section.
