alpha-Domination of Generalized Petersen Graph
碩士 === 國立交通大學 === 應用數學系所 === 102 === Let G = (V,E) be a graph with n vertices, m edges and no isolated vertices. For some α with 0 < α ≤ 1 and a set S ⊆ V, we say that S is α−dominating if for all v ∈ V − S, |N(v)∩ S| ≥ α|N(v)|. The size of a smallest such S is called the α−domination number of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27779682628490463135 |