#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2007

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Torsten Korneffel, Eberhard Triesch
- Combinatorica
- 2010

- Torsten Korneffel, Dirk Meierling, Lutz Volkmann
- Discussiones Mathematicae Graph Theory
- 2008

A subset D of the vertex set of a graph G is a (k, p)-dominating set if every vertex v ∈ V (G) \ D is within distance k to at least p vertices in D. The parameter γ k,p (G) denotes the minimum cardinality of a (k, p)-dominating set of G. In 1994, Bean, Henning and Swart posed the conjecture that γ k,p (G) ≤ p p+k n(G) for any graph G with δ k (G) ≥ k + p −… (More)

- Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen
- Discrete Mathematics
- 2009

Preface Reality provides many examples of something we call a search. Informally, we may have a goal (e.g., finding a lost key, a damaged light bulb, the shortest way to the next bus stop) and a set of possible actions to gain some information. All possible action needs some time, money, work etc., so that we want to calculate the expenses of our search… (More)

- ‹
- 1
- ›