| บทคัดย่อ |
Let H = (V, E) be a hypergraph. The hypergraph H is said to be k?uniform if every edge e ? E, |e| = k. A subset D ? V is dominating set of H if for every v ? V \ D there exists u ? D such that {u, v} ? e for some e ? E. A subset S ? V is said to be efficient dominating set of H if for any v ? V \ S there exists u ? S such that {u, v} ? e for some e ? E and |N(v) ? S| = 1 where N(v) = {w ? V |w, v ? e for some e ? E}. This research, some properties of domination of k? uniform hypergraphs and some conditions for k? uniform hypergraph with nonempty efficient dominating set are investigated. keywords: Hypergraph; Uniform hypergraph; Domination
|
|---|
| คำสำคัญ |
ไฮเพอร์กราฟ,ไฮเพอร์กราฟเอกรูป,เซตโดมิเนติง,Hypergraph,uniform hypergraph,dominating set
|
|---|
