Paired Domination versus Domination and Packing Number in Graphs

11/11/2019
by   Magda Dettlaff, et al.
0

Given a graph G=(V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ(G), γ_ pr(G), and γ_t(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k+1. The k-packing number is the order of a largest k-packing and is denoted by ρ_k(G). It is well known that γ_ pr(G) < 2γ(G). In this paper, we prove that it is NP-hard to determine whether γ_ pr(G) = 2γ(G) even for bipartite graphs. We provide a simple characterization of trees with γ_ pr(G) = 2γ(G), implying a polynomial-time recognition algorithm. We also prove that even for a bipartite graph, it is NP-hard to determine whether γ_ pr(G)=γ_t(G). We finally prove that it is both NP-hard to determine whether γ_ pr(G)=2ρ_4(G) and whether γ_ pr(G)=2ρ_3(G).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2020

Algorithmic Aspects of 2-Secure Domination in Graphs

Let G(V,E) be a simple, undirected and connected graph. A dominating set...
research
01/30/2020

Algorithmic Aspects of Secure Connected Domination in Graphs

Let G = (V,E) be a simple, undirected and connected graph. A connected d...
research
10/09/2018

On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs

Numerous problems consisting in identifying vertices in graphs using dis...
research
02/18/2018

Minimum length RNA folding trajectories

The Kinfold and KFOLD programs for RNA folding kinetics implement the Gi...
research
10/29/2018

A study on load-balanced variants of the bin packing problem

We consider several extensions of the fractional bin packing problem, a ...
research
12/21/2021

Sparse dominating sets and balanced neighborhood partitioning

Recent work in metagenomics constructs a partition of the assembly graph...
research
10/10/2018

On the Complexity of Solution Extension of Optimization Problems

The question if a given partial solution to a problem can be extended re...

Please sign up or login with your details

Forgot password? Click here to reset