Let G be a graph with vertex set V and no isolated vertices. A sub-set S ⊆ 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 γ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 , and we characterize the extremal graphs achieving equality in the bound.
SCImago Journal Rank (SJR) 2017: 0.633 Source Normalized Impact per Paper (SNIP) 2017: 1.095
Mathematical Citation Quotient (MCQ) 2017: 0.36
researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs