Name
Abstract | ||
|---|---|---|
Let G be a graph with vertex set V and no isolated vertices. A subset S subset of V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset are at most distance two apart. The semipaired domination number gamma(pr2)(G) is the minimum cardinality of a semipaired dominating set of G. We show that if G is a connected graph G of order n >= 3, then gamma(pr2)(G) <= 2/3 n, and we characterize the extremal graphs achieving equality in the bound. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.7151/dmgt.2143 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
paired-domination,semipaired domination | Discrete mathematics,Graph,Combinatorics,Domination analysis,Mathematics | Journal |
Volume | Issue | ISSN |
39 | 3 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teresa W. Haynes | 1 | 774 | 94.22 |
| Michael A. Henning | 2 | 1865 | 246.94 |