Name
Abstract | ||
|---|---|---|
Let k be a positive integer and G = (V(G),E(G)) a graph. A subset S of V(G) is a k-dominating set if every vertex of V(G) - S is adjacent to at least k vertices of S. The k-domination number gamma(k) (G) is the minimum cardinality of a k-dominating set of G. A graph G is called gamma(-)(k)-stable if gamma(k)(G - e) = gamma(k)(G) for every edge e of E(C). We first give a necessary and sufficient condition for gamma(-)(k)-stable graphs. Then for k >= 2 we provide a constructive characterization of gamma(-)(k)-stable trees. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.7151/dmgt.1492 | ARS COMBINATORIA |
Keywords | Field | DocType |
k-domination stable graphs,k-domination | Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Cardinality,Degree (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
119 | 2 | 0381-7032 |
Citations | PageRank | References |
1 | 0.36 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mustapha Chellali | 1 | 188 | 38.24 |
| Teresa W. Haynes | 2 | 774 | 94.22 |
| Lutz Volkmann | 3 | 943 | 147.74 |