| Summary: | 碩士 === 國立中央大學 === 數學研究所 === 97 === 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.
|
|---|
